Solution: Find K Pairs with Smallest Sums
Solution: Find K Pairs with Smallest Sums asks you to choose one value from each of two sorted integer arrays and return the requested number of pairs with the smallest sums.
Statement
You are given two integer arrays, list1 and list2, sorted in non-decreasing order, and an integer, k.
A pair list1 and one element list2.
Your task is to return the k pairs