-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathK-th element of two arrays
67 lines (53 loc) · 1.82 KB
/
K-th element of two arrays
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
64
65
66
67
//K-th element of two arrays
import java.io.*;
import java.lang.*;
import java.util.*;
class GFG {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine().trim());
while(t-- > 0) {
int k = Integer.parseInt(br.readLine().trim());
String[] line1 = br.readLine().trim().split(" ");
int[] a = new int[line1.length];
for(int i = 0; i < line1.length; i++) {
a[i] = Integer.parseInt(line1[i]);
}
String[] line2 = br.readLine().trim().split(" ");
int[] b = new int[line2.length];
for(int i = 0; i < line2.length; i++) {
b[i] = Integer.parseInt(line2[i]);
}
Solution ob = new Solution();
System.out.println(ob.kthElement(a, b, k));
System.out.println("~");
}
}
}
class Solution {
public int kthElement(int a[], int b[], int k) {
int n = a.length, m = b.length;
if(n > m) {
return kthElement(b, a, k);
}
int lo = Math.max(0, k - m), hi = Math.min(k, n);
while (lo <= hi) {
int mid1 = (lo + hi) / 2;
int mid2 = k - mid1;
int l1 = (mid1 == 0 ? Integer.MIN_VALUE : a[mid1 - 1]);
int r1 = (mid1 == n ? Integer.MAX_VALUE : a[mid1]);
int l2 = (mid2 == 0 ? Integer.MIN_VALUE : b[mid2 - 1]);
int r2 = (mid2 == m ? Integer.MAX_VALUE : b[mid2]);
if(l1 <= r2 && l2 <= r1) {
return Math.max(l1, l2);
}
if(l1 > r2) {
hi = mid1 - 1;
}
else {
lo = mid1 + 1;
}
}
return 0;
}
}