Leetcode 1874. Minimize Product Sum of Two Arrays

Given two equal-length arrays whose elements you may reorder, minimize the sum of element-wise products by choosing an optimal pairing between elements. The core insight is a greedy pairing strategy—match large values in one array with small values in the other (e.g., sort one ascending and the other descending) to minimize the total product sum.