class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        if(nums1.size() > nums2.size())
        return findMedianSortedArrays(nums2,nums1);

        int m = nums1.size();
        int n = nums2.size();

        int left = 0;
        int right = m;

        int me1 = 0;
        int me2 = 0;

        while(left <= right)
        {
            int i = (left+right)/2;
            int j =(m+n+1)/2-i;

            int n1min = (i == 0 ? INT_MIN : nums1[i-1]);
            int n1i = (i == m ? INT_MAX : nums1[i]);
            int n2min = (j == 0 ? INT_MIN : nums2[j-1]);
            int n2j = (j == n ? INT_MAX : nums2[j]);

            if(n1min <= n2j)
            {
                me1 = max(n1min,n2min);
                me2 = min(n1i,n2j);
                left = i+1;
            }
            else
            {
                right = i-1;
            }
        }

        return (m+n)%2 == 0 ? (me1+me2)/2.0 : me1;
    }
};