无重叠区间

class Solution {
public:
    static bool cmp(vector<int> &A, vector<int> &B){
        return A[0] < B[0];
    }

    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end(), cmp);

        int count = 1;
        for(int i = 1; i < intervals.size(); i++){
            if(intervals[i][0] < intervals[i - 1][1]){
                intervals[i][1] = min(intervals[i - 1][1], intervals[i][1]);
            }else{
                count++;
            }
        }

        return intervals.size() - count;
    }
};