452. Minimum Number of Arrows to Burst Balloons

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

An arrow can be shot up exactly vertically from different points along the x-axis. A balloon with xstart and xend bursts by an arrow shot at x if xstart ≤ x ≤ xend. There is no limit to the number of arrows that can be shot. An arrow once shot keeps travelling up infinitely. The problem is to find the minimum number of arrows that must be shot to burst all balloons.

Example:

Input:
[[10,16], [2,8], [1,6], [7,12]]

Output:
2

Explanation:
One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8] and [1,6]) and another arrow at x = 11 (bursting the other two balloons).

思路：贪心；题目的意思是有一个个区间，希望用最少的线将所有的区间都穿过。首先，将所有的区间按其end为关键值进行增序排序。每次选择的位置都在区间的end处，如果它能包含后面的区间，就一个个往后找，直到有个区间的start在这个线之外，即start>end，说明又要有一次射击了。它的射击位置仍在该区间的end处。

class Solution {
public:
    int findMinArrowShots(vector<pair<int, int>>& points) {
        int n=points.size();
        if(!n) return 0;
        sort(points.begin(),points.end(),[](pair<int,int>a,pair<int,int> b){
            return a.second<b.second;
        });
        int cnt=0;int i=0,j=0;
        while(i<n)
        {
            int t=points[i].second; cnt++;//每次射击都在区间的end
             j=i+1;
            while(j<n&&points[j].first<=t)//寻找下一次射击位置
            j++;
            i=j;
        }
        return cnt;
    }
};