public int kthLargest(int input1[],int input2[],int k){
        return kthLargest(input1, input2, 0, input1.length-1, 0, input2.length-1, k);
    }
http://stackoverflow.com/questions/4686823/given-2-sorted-arrays-of-integers-find-the-nth-largest-number-in-sublinear-time
http://articles.leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html
src/com/interview/array/KthLargestInTwoSortedArray.java