package question;

import java.util.Arrays;
import java.util.Comparator;

public class Question435 {
 public static void main(String[] args) {

 }

 public int eraseOverlapIntervals(int[][] intervals) {
 Arrays.sort(intervals, new Comparator<int[]>() {
 @Override
 public int compare(int[] ints, int[] t1) {
 return ints[1] - t1[1];
 }
 });

 int end = Integer.MIN_VALUE;
 int cnt = 0;
 for (int i = 0; i < intervals.length; i++) {
 if (intervals[i][0] >= end) {
 cnt++;
 end = intervals[i][1];
 }
 }
 return intervals.length - cnt;
 }
}