k-th element out of n sorted tables

Exercise 4.11

Design an algorithm with cost \Theta(k \log n + n) that, given n tables increasingly sorted with n elements each and a given k, finds the k-th global lowest element.

After class

If you have not already done it, you might want to solve the Jutge problem K-th element from the section Use of STL data structures. (We saw problems from that section during the lab L1.)