4. Median of Two Sorted Arrays *HARD* -- 查找两个排序数组的中位数（寻找两个排序数组中第k大的数）

There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

t int MAX = 0x7fffffff, MIN = 0x80000000;
int kth(vector<int>& nums1, vector<int>& nums2, int sz1, int sz2, int k)
{
#define N1(i) (i<1?MIN:(i>sz1?MAX:nums1[i-1]))
#define N2(i) (i<1?MIN:(i>sz2?MAX:nums2[i-1]))
    int l, r, x;
    l = ;
    r = sz1;
    while (l <= r)
    {
        x = (l + r) >> ;
        if (N1(x) > N2(k - x + ))
            r = x - ;
        else if (N1(x + ) < N2(k - x))
            l = x + ;
        else
            return max(N1(x), N2(k - x));
    }
    return ; //should not get here
#undef N1
#undef N2
}

double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
    int sz1 = nums1.size(), sz2 = nums2.size(), sz = sz1 + sz2;
    if (sz1 > sz2)
        return findMedianSortedArrays(nums2, nums1);
    if (sz & )
        return kth(nums1, nums2, sz1, sz2, (sz >> ) + );
    return (kth(nums1, nums2, sz1, sz2, sz >> ) + kth(nums1, nums2, sz1, sz2, (sz >> ) + )) / 2.0;
}