class Solution {public:    double findMedianSortedArrays(vector
     
      & nums1, vector
      
       & nums2) {        int m = nums1.size(), n = nums2.size();        return (findKth(nums1, nums2, (m + n + 1) / 2) + findKth(nums1, nums2, (m + n + 2) / 2)) / 2.0;    }    int findKth(vector
       
         nums1, vector
        
          nums2, int k) {        int m = nums1.size(), n = nums2.size();        if (m > n) return findKth(nums2, nums1, k);        if (m == 0) return nums2[k - 1];        if (k == 1) return min(nums1[0], nums2[0]);        int i = min(m, k / 2), j = min(n, k / 2);        if (nums1[i - 1] > nums2[j - 1]) {            return findKth(nums1, vector
         
          (nums2.begin() + j, nums2.end()), k - j);        } else {            return findKth(vector
          
           (nums1.begin() + i, nums1.end()), nums2, k - i); } return 0; }};