**Source:**Just made it up!

**Problem:**

Easy: Given 2 sorted arrays of size n, give an efficient algorithm to find the kth largest number.

Hard: Given m sorted arrays of size n each, give an efficient algorithm to find the kth largest number.

Update (04 December 2010)

**Solution:**Posted by Gaurav Sinha (chera) (CSE IITK 1996 Graduate, Now working at Indian Revenue Service) in comments! Another solution posted by me in comments!