public static double findMedianSortedArrays(int[] A, int[] B) {
		int m=A.length, n=B.length;
		if (((m+n)&1)==1)
			return kthHelper(A,B,(m+n+1)/2);
		else 
			return (kthHelper(A,B,(m+n)/2)+kthHelper(A,B,(m+n)/2+1))/2.0;
	}