package collection4;

/*
 * Given two sorted arrays A, B of size m and n respectively. Find the k-th
 *  smallest element in the union of A and B. You can assume that there are
 *   no duplicate elements.
 */
public class kthunion {

	 

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}
