Finding kth smallest number from n sorted arrays

Question

So, you have n sorted arrays (not necessarily of equal length), and you are to return the kth smallest element in the combined array (i.e the combined array formed by mergin

Answer 1

There exist an generalization that solves the problem in O(N log k) time, see the question here.