Find K Pairs with Smallest Sums

Statement

Given two arrays and an integer $k$, find $k$ pairs of numbers with the smallest sum so that in each pair, each array contributes one number to the pair.

Constraints:

• $1$ $\leq$ ...