-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path공유기 설치.java
56 lines (43 loc) · 1.28 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
import java.util.*;
import java.io.*;
public class Main {
private static int N,C;
private static int[] home;
private static int left, right;
public static void main(String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
C = Integer.parseInt(st.nextToken());
home = new int[N];
for(int i = 0; i < N; i++){
home[i] = Integer.parseInt(br.readLine());
}
Arrays.sort(home);
left = 1;
right = home[N-1] - home[0]+1;
find();
}
private static void find(){
while(left < right){
int mid = (left+right)/2;
if(check(mid) >= C){
left = mid +1;
}else{
right = mid;
}
}
System.out.print(left-1);
}
private static int check(int mid){
int cnt = 1;
int start = home[0];
for(int i = 1; i < N; i++){
if(home[i] - start >= mid){
start = home[i];
cnt ++;
}
}
return cnt;
}
}