1
class Solution {
2
 public:
3
  int removeCoveredIntervals(vector<vector<int>> &intervals) {
4
    int cnt = 0, last = INT_MIN;
5
    sort(intervals.begin(), intervals.end(), [](const vector<int> &v1, const vector<int> &v2) {
6
      if (v1[0] != v2[0])
7
        return v1[0] < v2[0];
8
      else
9
        return v1[1] > v2[1];
10
    });
11

12
    for (int i = 0; i < intervals.size(); i++) {
13
      if (intervals[i][1] <= last) ++cnt;
14

15
      if (intervals[i][1] > last) last = intervals[i][1];
16
    }
17

18
    return intervals.size() - cnt;
19
  }
20
};