-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathboj_1931.java
47 lines (38 loc) · 1.31 KB
/
boj_1931.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
40
41
42
43
44
45
46
47
package greedy;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class boj_1931 {
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
int[][] arr=new int[n][2];
int result=0;
for(int i=0;i<n;i++){
StringTokenizer st=new StringTokenizer(br.readLine()," ");
arr[i][0]=Integer.parseInt(st.nextToken());
arr[i][1]=Integer.parseInt(st.nextToken());
}
//아.. compartor을 쓰는건 알겠는데 까먹었다..
Arrays.sort(arr, new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
if(o1[1] == o2[1]) { //종료 시간이 같으면
return o1[0] - o2[0]; //시작 시간 기준으로
}
return o1[1] - o2[1];//종료 시간 기준으로
}
});
int end=0;
for(int i=0;i<n;i++){
if(end<=arr[i][0]){
end=arr[i][1];
result++;
}
}
System.out.println(result);
}
}