AcWing 803. 区间合并 （java）【区间合并】

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[][] a = new int[n][2];
        for(int i = 0 ;i < n; i++){
            a[i][0] = scan.nextInt();
            a[i][1] = scan.nextInt();
        }
        
        Arrays.sort(a, new Comparator<int[]>(){
            public int compare(int[] o1, int[] o2){
                return o1[0] - o2[0];
            }
        });
        
        int res = 0;
        int r = Integer.MIN_VALUE;
        for(int i = 0; i < n; i++){
            if(r < a[i][0]){
                res ++;
            }
            r = Math.max(r, a[i][1]);
        }
        
        System.out.println(res);
    }
}