You are given two sorted lists of size m and n. Give an O (log m + log n) time algorithm for computing the kth smallest element in the union of the two lists.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.