백준 1931 회의실배정(Java)

https://www.acmicpc.net/problem/1931

1931번: 회의실 배정

---

 

 

Java 코드

 

---

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

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int count = 0;
    int end = 0;
    int n = sc.nextInt();
    int[][] arr = new int[n][2];
   
    for(int i = 0; i < n; i++) {
      arr[i][0] = sc.nextInt();
      arr[i][1] = sc.nextInt();
    }

    Arrays.sort(arr, new Comparator<int[]>() {
      public int compare(int[] o1, int[] o2) {
        if(o1[1] == o2[1]) return o1[0] - o2[0];
        else return o1[1] - o2[1];
      }
    });

    for(int i = 0; i < n; i++) {
      if(end <= arr[i][0]) {
        end = arr[i][1];
        count++;
      }
    }
    
    System.out.println(count);
  }
}