-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathangry.java
More file actions
60 lines (47 loc) · 1.61 KB
/
angry.java
File metadata and controls
60 lines (47 loc) · 1.61 KB
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
57
58
59
60
import sun.awt.image.ImageWatched;
import javax.print.DocFlavor;
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.StringTokenizer;
public class angry {
public static void main(String[] args) throws IOException {
// write your code here
BufferedReader f = new BufferedReader(new FileReader("angry.in"));
// input file name goes above
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("angry.out")));
StringTokenizer st = new StringTokenizer(f.readLine());
PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("angry.out")));
//StringTokenizer st = new StringTokenizer(f.readLine());
int n = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
int[] locations = new int[n];
for(int i = 0; i < n; i++) {
locations[i] = Integer.parseInt(f.readLine());
}
Arrays.sort(locations);
int min = 0;
int max = 500000000;
while(min != max) {
int mid = (min + max) / 2;
int used = 0;
int last = 0;
while (last < n) {
used++;
int curr = last + 1;
while (curr < n && locations[curr] - locations[last] <= 2 * mid) {
curr++;
}
last = curr;
}
if (used <= k) {
max = mid;
} else {
min = mid + 1;
}
}
out.println(min);
out.close();
}
}