435. Non-overlapping Intervals.cpp

class Solution {
public:
    static bool cmp(const vector<int> &a,const vector<int> &b) 
    { 
        return a[1] < b[1]; 
    }
    int eraseOverlapIntervals(vector<vector<int>>& intervals)
    {
        sort(intervals.begin(),intervals.end(),cmp);

        int ans = 0;
        int end_time = intervals[0][1];

        for(int i = 1;i<intervals.size();i++)
        {
            if(intervals[i][0]<end_time)
            {
                ans++;
            }
            else
            {
                end_time = intervals[i][1];
            }
        }
        return ans;
    }
};