You are given an integer array enemyEnergies where each element represents the energy value of an enemy, and an integer currentEnergy representing your initial energy.

You start with $0$ points, and all enemies are initially unmarked. You may perform either of the following operations any number of times to accumulate points:

Operation 1 — Choose an unmarked enemy i such that currentEnergy >= enemyEnergies[i]:

• Your points increase by $1$.

• Your energy decreases: currentEnergy = currentEnergy - enemyEnergies[i].

Operation 2 — If you have at least $1$ point, choose any unmarked enemy i:

• Your energy increases: currentEnergy = currentEnergy + enemyEnergies[i].

• Enemy i becomes marked.

Return the maximum number of points you can achieve by performing these operations optimally.

Constraints:

• $1 \leq$ enemyEnergies.length $\leq 10^5$

• $1 \leq$ enemyEnergies[i] $\leq 10^9$

• $0 \leq$ currentEnergy $\leq 10^9$

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.