Leetcode 1648. Sell Diminishing-Valued Colored Balls

Given inventories where each sale of a color yields value equal to its current count and reduces that count by one, choose which balls to sell to maximize total revenue for exactly orders sales. The challenge is efficiently selecting the top "orders" values from multiple decreasing integer sequences (large values/modulo), typically solved by thresholding/binary-search and arithmetic-sum counting.