-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
63 lines (53 loc) · 1.66 KB
/
Main.java
File metadata and controls
63 lines (53 loc) · 1.66 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;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int K = Integer.parseInt(st.nextToken());
int[] arr = new int[N];
st = new StringTokenizer(br.readLine());
for(int i=0; i<N; i++){
arr[i] = Integer.parseInt(st.nextToken());
}
int[] answer = mergeSort(arr);
System.out.println(answer[K-1]);
br.close();
}
public static int[] mergeSort(int[] arr){
if(arr.length <= 1){
return arr;
}
int mid = arr.length / 2;
int[] left = mergeSort(Arrays.copyOfRange(arr, 0, mid));
int[] right = mergeSort(Arrays.copyOfRange(arr, mid, arr.length));
int i = 0, j=0, k = 0;
while(i<left.length && j <right.length){
if(left[i] < right[j]){
arr[k] = left[i];
i++;
} else {
arr[k] = right[j];
j++;
}
k++;
}
if(i == left.length){
while(j < right.length){
arr[k] = right[j];
j++;
k++;
}
} else if (j == right.length){
while(i < left.length){
arr[k] = left[i];
i++;
k++;
}
}
return arr;
}
}