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).

思路：这个题目中若两个气球的范围不相交，则一定是被坐标不同的针扎破的。所以想到先对这些数据队排序（按照气球的结尾坐标来从小到大排序），使temp等于排序后的第一个元素的结束值，如果后面气球的开始坐标比temp小，则这这些气球可以被一个针扎破；若有一个气球的开始坐标比temp大，则表示后面的气球不能和前面几个气球一起被一个针扎破，所以针的个数要加一，然后使temp等于该气球的结束坐标，然后往后面找可以和该气球一起被一个针扎破的气球，遍历这个数组后就可以得到结果。这题的难点是排序应该按照什么规则来排，因为后面的气球需要看前面的结束值，所以先按结束的值来排，如果结束的值相同在安装开始的值来排。

代码：

class Solution {
public:
    static bool newsort(pair<int,int> &m, pair<int,int> &n)
    {
        return m.second == n.second?m.first<n.first:m.second<n.second;
    }
    int findMinArrowShots(vector<pair<int, int>>& points) {
        int size1 = points.size();
        int count =0,temp = INT_MIN;
        sort(points.begin(),points.end(),newsort);
        for(int i = 0;i<size1;i++)
        {
            if(temp == INT_MIN || points[i].first > temp)
            {
                temp = points[i].second;
                count++;
            }
            
        }
        return count;
        
        
    }
};