You are given two integer arrays nums and threshold, both of length n.

Starting at step = $1$ with an initial sum of $0$, you perform the following operation at each step:

• Choose any unvisited index i such that threshold[i] \leq step.

• Add nums[i] to the total sum and mark index i as visited.

• Advance to step + $1$.

If at any step no unvisited index i satisfies threshold[i] \leq step, the process terminates immediately. The process also terminates if all $n$ indices have been visited.

Return the maximum total sum that can be achieved.

Constraints:

• $n ==$ nums.length $==$ threshold.length

• $1 \leq n \leq 10^5$

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

• $1 \leq$ threshold[i] $\leq n$

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.