射击气球

#include <algorithm>
#include<vector>
bool cmp(const std::pair<int,int> &a,const std::pair<int ,int> &b){
    return a.first < b.first;//无需考虑左端点相同时的排序
class Solution{
public:
    int findMinArrowShots(std::vetor<std::pair<int,int>> &points){
    if(points.size() == 0){
        return 0;
    }
    std::sort(points.begin(),points.end(),cmp);//对气球按照左端点从小到大排序
    int shoot_num = 1;//初始化弓箭手数量为1
    int shoot_begin = points[0].first;//初始化射击区间，即为第一个气球的两端点
    int shoot_end = points[0].second;
    for(int i =1; i< points.size();i++){
        if(point[i].first <shoot_end){
            shoot_begin = points[i].first;
            if(shoot_end > points[i].second){
                shoot_end = points[i].second;
            }
        }
        else{
            shoot_num ++;
            shoot_begin = points[i].first;
            shoot_end = points[i].second;
        }
}
    return shoot_num;
}
}; 
}