-
Notifications
You must be signed in to change notification settings - Fork 2
/
최하라.java
39 lines (35 loc) · 1.18 KB
/
최하라.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
// Build schedule
int N = Integer.parseInt(br.readLine());
int[][] schedule = new int[N][2];
for (int i = 0; i < N; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
schedule[i][0] = Integer.parseInt(st.nextToken());
schedule[i][1] = Integer.parseInt(st.nextToken());
}
// Sort base on end time
Arrays.sort(schedule,new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
if (o1[1] == o2[1])
return o1[0] - o2[0];
else
return o1[1] - o2[1];
}
});
// 끝나는 지점에서 그 이후 방 찾기
int end = 0;
int count = 0;
for (int i = 0; i < N; i++) {
if (end <= schedule[i][0]) {
count++;
end = schedule[i][1];
}
}
System.out.println(count);
}
}