Choose Numbers From Two Arrays in Range

Given two integer arrays and a numeric interval/width constraint, pick elements from either array so that the resulting selection's values all lie within that range (or have max−min ≤ K), subject to any selection limits, and determine feasibility or an optimal count/cost. Solving it typically requires interval sweeping, greedy choices combined with DP or flow to manage overlapping options and per-array constraints.