You are given an integer array rewardValues of size $n$.

Initially, your total reward x is $0$, and all indices are unmarked. You can perform the following operation any number of times:

1. Pick an unmarked index i from $0$ to $n - 1$ such that rewardValues[i] > x.

2. Add rewardValues[i] to your current total reward x (i.e., x = x + rewardValues[i]).

3. Mark the index i.

Return the maximum total reward x you can achieve by performing the operations optimally.

Constraints:

• $1 \leq$ rewardValues.length $\leq 5 imes 10^4$

• $1 \leq$ rewardValues[i] $\leq 5 imes 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.