Leetcode 3180. Maximum Total Reward Using Operations I

Select a sequence of elements from rewardValues (starting with total x = 0) so that each chosen value is strictly greater than the current total and the final total is maximized. The core challenge is ordering/selection under this "value > running sum" constraint — it reduces to choosing which values to pick (greedy by ascending values yields the optimum).