Leetcode 373. Find K Pairs with Smallest Sums

Given two non-decreasing arrays, return the k pairs (one element from each) with the smallest sums — the challenge is to efficiently produce the smallest k sums from the Cartesian product without enumerating all pairs, typically via a min-heap / k-way merge.