You are given an integer array rewardValues, representing the values of rewards.

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

• Choose an unmarked index i such that rewardValues[i] is strictly greater than your current total reward x.

• Add rewardValues[i] to x and mark the index i.

Return the maximum total reward you can collect by performing these operations optimally.

Constraints:

• $1 \leq$ rewardValues.length $\leq 2000$

• $1 \leq$ rewardValues[i] $\leq 2000$

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.