Leetcode 3075. Maximize Happiness of Selected Children

Pick k elements sequentially from an array where each selection reduces every remaining positive value by 1 (clamped at 0); determine the maximum total sum of selected values. This is an ordering/greedy optimization problem (n up to 2e5) where each pick creates a global diminishing effect on future picks.