原题链接:https://leetcode.com/problems/queue-reconstruction-by-height/
bool cmp(vector<int> a, vector<int> b) {
return a[1] < b[1];
}
class Solution {
public:
int findMinArrowShots(vector<vector<int>>& points) {
sort(points.begin(), points.end(), cmp);
int res = 0, r = INT_MIN;
if (points.size() == 1 && points[0][0] == INT_MIN) res++;
for (auto p : points) {
if (p[0] > r) {
r = p[1];
res ++ ;
}
}
return res;
}
};