Leetcode 3181. Maximum Total Reward Using Operations II

Starting from x = 0, you may repeatedly choose any unpicked element whose value is strictly greater than the current sum and add it to x; return the maximum final sum achievable. The core challenge is selecting and ordering a subset of elements so each chosen value exceeds the running prefix sum, which requires careful greedy/DP reasoning under the strict feasibility constraint.