You have two sorted array of sizes m and n. How will find the k-th smallest number when these two sorted arrays are merged?
Try to get logarithmic performing algorithm
I have not tried a logarithmic performing one. But a O(k) performance code is easy to do. Just take two indices in a merge algorithm and traverse it.