Find K Pairs with Smallest Sums

You are given two integer arrays nums1 and nums2 sorted in non-decreasing order, and an integer k. Examples Example 1: Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3 Output: [[1,2],[1,4],[1,6]] Example 2: Input: nums1 = [1,1,2], nums2 = [1,2,3], k = 2 Output: [[1,1],[1,1]] Constraints 1 <= nums1.length, nums2.length <= 10^5 -10^9 <= nums1[i], nums2[i] <= 10^9 nums1 and nums2 are sorted in non-decreasing order. 1 <= k <= 10^4