class Solution
{
public:
double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
{
double ans;
int size1=nums1.size();
int size2=nums2.size();
bool isEven=((size1+size2)%2==0)?true:false;
int breakPoint=(size1+size2)/2+1;
int i=0;
int j=0;
int c=0;
while(i<size1||j<size2)
{
if((i<size1&&j==size2)||(i<size1&&j<size2&&nums1[i]<=nums2[j]))
{
c++;
if(c==breakPoint)
{
if(isEven)
{
ans+=nums1[i];
ans/=2.0;
}
else
ans=nums1[i];
break;
}
ans=nums1[i++];
}
else
{
c++;
if(c==breakPoint)
{
if(isEven)
{
ans+=nums2[j];
ans/=2.0;
}
else
ans=nums2[j];
break;
}
ans=nums2[j++];
}
}
return ans;
}
};