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