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

计算不重叠的区间个数，[1, 2] 和 [2, 3] 在本题中算是重叠区间。

气球在一个水平数轴上摆放，可以重叠，飞镖垂直投向坐标轴，使得路径上的气球都会刺破。求解最小的投飞镖次数使所有气球都被刺破。

C++:

 bool compare(pair<int, int> a , pair<int, int> b){

     return a.second < b.second ;

 }

 class Solution {

 public:

     int findMinArrowShots(vector<pair<int, int>>& points) {

         if (points.size() == ){

             return  ;

         }

         sort(points.begin() , points.end() , compare) ;

         int cnt =  ;

         int end = points[].second ;

         for(int i =  ; i < points.size() ; i++){

             if (points[i].first <= end){

                 continue ;

             }

             cnt++ ;

             end =  points[i].second ;

         }

         return cnt ;

     }

 };