Leetcode 452. Minimum Number of Arrows to Burst Balloons[medium]

题目：
here 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).

---

贪心。
如果按照右端点将线段排序之后，考虑第一个线段，如果想要覆盖这个线段，显然在右端点覆盖这个线段最划算，因为这样可以覆盖尽可能多的线段。
然后将这一步覆盖的所有线段删除，用同样的方法求解，直到所有线段被覆盖为止。

判断一个直线被覆盖，只需要判断当前直线的左端点是否比第一个线段的右端点大即可。

bool cmpt(const pair<int, int> a, const pair<int, int> b) {
    return a.second < b.second;
}

class Solution {
public:
    int findMinArrowShots(vector< pair<int, int> >& points) {
        if (points.size() == 0) return 0;
        sort(points.begin(), points.end(), cmpt);
        int last;
        int ans = 0;
        ans++;
        last = points[0].second;
        for (int i = 1; i < points.size(); i++) {
            if (points[i].first > last) {
                ans++;
                last = points[i].second;
            }
        }
        return ans;
    }
};

不太清楚为什么这个比较函数要写在类外面才能用。