Leetcode: 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]

解法：用multimap做最小堆。

class Solution {
public:
    vector<pair<int, int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        vector<pair<int, int>> result;
        multimap<int, pair<int, int> >minheap;
        int cnt = 0;

        if (nums1.size() == 0 || nums2.size() == 0) {
            return result;
        }

        for (int i = 0; i < nums1.size(); ++i) {
            minheap.insert(make_pair(nums1[i]+nums2[0], make_pair(i, 0)));
        }

        while (cnt < k && !minheap.empty()) {
            multimap<int, pair<int, int> >::iterator it = minheap.begin();
            int i1 = (*it).second.first;
            int i2 = (*it).second.second;

            result.push_back(make_pair(nums1[i1], nums2[i2]));
            int next = i2 + 1;
            if (next < nums2.size()) {
                minheap.insert(make_pair(nums1[i1]+nums2[next], 
                               make_pair(i1, next)));
            }

            minheap.erase(it);
            cnt++;
        }

        return result;
    }
};

时间复杂度：O(n + Klogn)，n为nums1中元素个数。