1.You are given 2 arrays sorted in decreasing order of size m and n
Input: a number k <= n*n and >= 1
Output: the kth largest sum(a+b) possible. where
a (any element from array 1)
b (any element from array 2)

2. An array contains the set of positive integer. Find the largest number
c such that c=a+b where a,b,c are distinct number of the set?
[Consider , reducing complexity]