You are given two sorted lists of size m and n. Given an O(logm+logn) time algorithm for computing the k-th smallest element of the two lists.

function res = getSmallest(k, x, y)

//your answer goes here

================

Data structure & Algorithm problem.

Read carefully and Only full answers will get positive rated. Thank you.