-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1931.java
More file actions
47 lines (32 loc) · 1007 Bytes
/
Copy path1931.java
File metadata and controls
47 lines (32 loc) · 1007 Bytes
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
40
41
42
43
44
45
46
47
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
class Main{
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int[][] time = new int[N][2];
for(int i = 0; i < N; i++) {
time[i][0] = in.nextInt();
time[i][1] = in.nextInt();
}
Arrays.sort(time, new Comparator<int[]>(){
@Override
public int compare(int[] start, int[] end) {
if(start[1] == end[1]) {
return Integer.compare(start[0], end[0]);
}
return Integer.compare(start[1], end[1]);
}
});
int count = 0;
int endTime = 0;
for(int i = 0; i < N; i++) {
if(endTime <= time[i][0]) {
count++;
endTime = time[i][1];
}
}
System.out.println(count);
}
}