-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBJAlgo_11004.java
More file actions
63 lines (52 loc) · 1.69 KB
/
Copy pathBJAlgo_11004.java
File metadata and controls
63 lines (52 loc) · 1.69 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
61
62
63
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class BJAlgo_11004 {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int[] nk = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
int[] nums = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
// Arrays.sort(nums);
nums = mergeSort(nums);
System.out.println(nums[nk[1] - 1]);
}
private static int[] mergeSort(int[] array) {
if (array.length == 1) {
return array;
}
int mid = array.length / 2;
int[] left = new int[mid];
System.arraycopy(array, 0, left, 0, left.length);
left = mergeSort(left);
int[] right = new int[array.length - mid];
System.arraycopy(array, mid, right, 0, right.length);
right = mergeSort(right);
int i = 0;
int j = 0;
int k = 0;
while (i < left.length && j < right.length) {
if (left[i] < right[j]) {
array[k] = left[i];
i += 1;
} else {
array[k] = right[j];
j += 1;
}
k += 1;
}
if (i == left.length) {
while (j < right.length) {
array[k] = right[j];
j += 1;
k += 1;
}
} else if (j == right.length) {
while (i < left.length) {
array[k] = left[i];
i += 1;
k += 1;
}
}
return array;
}
}