373. Find K Pairs with Smallest Sums

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

Define a pair (u,v) which consists of one element from the first array and one element from the second array.

Find the k pairs (u1,v1),(u2,v2) ...(uk,vk) with the smallest sums.

Example 1:

Given nums1 = [1,7,11], nums2 = [2,4,6],  k = 3

Return: [1,2],[1,4],[1,6]

The first 3 pairs are returned from the sequence:
[1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]

Example 2:

Given nums1 = [1,1,2], nums2 = [1,2,3],  k = 2

Return: [1,1],[1,1]

The first 2 pairs are returned from the sequence:
[1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]

Example 3:

Given nums1 = [1,2], nums2 = [3],  k = 3 

Return: [1,3],[2,3]

All possible pairs are returned from the sequence:
[1,3],[2,3]

solution1:

class Solution {
public:
    vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        
          int nums_1 = nums1.size();
          int nums_2 = nums2.size();
          vector<pair<int, int>> result;
          
          k = min(k,nums_1*nums_2);
          vector<int> indice(nums_1, 0);
          while(k-->0)
          {
              int temp_idx = 0;
              long temp_max = LONG_MAX;
              for(int i=0; i<nums_1; i++)
              {
                  if(indice[i]<nums_2&&temp_max>=(nums1[i]+nums2[indice[i]]))
                  {
                      temp_idx = i;
                      temp_max = nums1[i]+nums2[indice[i]];
                  }
              }
              result.push_back(make_pair(nums1[temp_idx], nums2[indice[temp_idx]]));
              indice[temp_idx]++;
          }
          return result;       
    }
};

   solution2:

class Solution {
private:
    struct mycompare{
      bool operator()(pair<int,int> &first, pair<int,int> &second)
      {
          return first.first+first.second < second.first + second.second;
      }
        
    };
public:
    
    vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        
       vector<pair<int, int>> result;
       priority_queue<pair<int,int>, vector<pair<int, int> >, mycompare> pq;
       for(int i=0; i<min((int)nums1.size(),k);i++)
       {
           for(int j=0; j<min((int)nums2.size(),k);j++)
           {
               if(pq.size()<k)
                   pq.push(make_pair(nums1[i], nums2[j]));
               else if(nums1[i]+nums2[j]<pq.top().first+pq.top().second)
               {
                   pq.push(make_pair(nums1[i], nums2[j]));
                   pq.pop();
               }
           }
       }
       while(!pq.empty())
       {
           result.push_back(pq.top());
           pq.pop();
       }
    
       return result;
    }
};