double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { vector<int>ans; int l=0; int r=0; while(l<nums1.size() and r<nums2.size()) { if(nums1[l]<nums2[r]) { ans.push_back(nums1[l]); l++; } else { ans.push_back(nums2[r]); r++; } } if(l<nums1.size()) { while(l<nums1.size()) { ans.push_back(nums1[l]); l++; } } if(r<nums2.size()) { while(r<nums2.size()) { ans.push_back(nums2[r]); r++; } } int size=ans.size(); if(size%2==1) { return ans[size/2]; } else { int a = ans[size / 2 - 1]; int b = ans[size / 2]; return (a + b) / 2.0; } return -1; }