leetcode373. Find and minimum k-pair numbers (medium)

Same as leetcode378. In order matrix K Small elements （ secondary ） similar
https://blog.csdn.net/zhangjiaji111/article/details/122716718

Ideas ： Merge sort
Wrong idea at first ： The first v1[0]v2[0] Put it in , Then get v1[x] v2[y] If you will v1[x+1] v2[y] and v1[x] v2[y+1] If you put it in, it will repeat ！
Positive solution ： First the [0…min(k,n-1)][0] Put it in , Every time I get it v1[x]v2[y] take v1[x]v2[y+1] Put in

class Solution {
    
public:
    struct cmp{
    
        bool operator()(vector<int>& v1, vector<int>& v2) {
    
            return v1[0] + v1[1] > v2[0] + v2[1];
        }
    };
    vector<vector<int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
    
 
        vector<vector<int>> ans;
        priority_queue<vector<int>, vector<vector<int>>, cmp> pq;
        int n = nums1.size(), m = nums2.size();
        for (int i = 0; i < min(k, n); ++i) {
    
            pq.push(vector<int>{
    nums1[i], nums2[0], i, 0});
        }
        while (k > 0) {
    
            if(pq.empty()) break;
            auto tp = pq.top();
            pq.pop();
            ans.push_back(vector<int>{
    tp[0], tp[1]});
            if (tp[3] < m - 1) pq.push(vector<int>{
    nums1[tp[2]],nums2[tp[3]+1],tp[2],tp[3]+1});
            k--;
        }
        return ans;
    }
};