228. Find K Pairs with Smallest Sums

MediumHeap

You are given two integer arrays nums1 and nums2 sorted in non-decreasing 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. Return the k pairs (u1, v1), (u2, v2), ..., (uk, vk) with the smallest sums.

Examples

Input: [1,7,11] [2,4,6] 3

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

Explanation: The three pairs with the smallest sums: 3, 5, 7.

Constraints

  • 1 <= nums1.length, nums2.length <= 10^5
  • -10^9 <= nums1[i], nums2[i] <= 10^9
  • nums1 and nums2 both are sorted in non-decreasing order.
  • 1 <= k <= 10^4
  • k <= nums1.length * nums2.length
Loading...

Run checks all cases above. Submit evaluates all test cases.