Find the nearest sum to a given number of two elements in sorted matrix
Try something like binary search since it is sorted
i.e. check a[n/2,n]+a [n/2 +1,1] if equal done
-smaller check the lower half
-greater check the upper half
(Keep the last checked value to compare how close with the next one)
Probably O ( log n2)