K-th of Two Sorted Arrays
Two arrays are already sorted. Print the K-th smallest element of their union (duplicates kept).
Input: the first line has N, M and K; the second line has the N sorted values of A; the third line has the M sorted values of B.
Output: the K-th smallest element of the merged multiset.
Constraints:
- 1 ≤ N, M ≤ 105
- 1 ≤ K ≤ N+M
- −109 ≤ values ≤ 109
Sample Tests
Input 1
3 3 4 1 3 5 2 4 6
Output 1
4
Input 2
1 1 2 5 1
Output 2
5
Discussion (opens after you solve — no spoilers before)
No comments yet.