Two sorted array ascending order, find kth smallest sum of a+b, a from first array, b from second one.

Problem statement:

Two sorted array ascending order, find kth smallest sum of a+b, a from first array, b from second one.

Try to figure out the solution by myself, first 20 minutes,

and then, go through google, read this article:  on May 8, 2015

http://www.cnblogs.com/wuchanming/p/3840345.html

http://articles.leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html