4. Median of Two Sorted Arrays

https://leetcode.com/problems/median-of-two-sorted-arrays/description/

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        
        
        int i = 0;
        int size1 = nums1.size();
        int size2 = nums2.size();
        
        multiset<int> sum;
        
        while(1)
        {
            if(i < size1)
            {
                sum.insert(nums1[i]);
            }
                
            
            if(i < size2)
            {
                sum.insert(nums2[i]);
            }
                
            
            ++i;
            
            if(i>=size1 && i>=size2)
                break;
        }
       
        multiset<int>::iterator iter;
        vector<int> sorted;
        for(iter = sum.begin(); iter != sum.end(); ++iter)
        {
            sorted.push_back(*iter);
        }
    
        int sortedsize = sorted.size();
        //printf("%d\n", sortedsize);
        if(sortedsize%2==0)
        {
            int num1 = sorted[sortedsize/2-1];
            int num2 = sorted[sortedsize/2];
            return ((num1 + num2) / 2.f);
        }
        else
        {
            return sorted[sortedsize/2];
        }
    }
};