[LeetCode] 373. Find K Pairs with Smallest Sums 找和最小的K对数字

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 t