There is a special apple tree that produces apples for n consecutive days. On day i (starting from day $0$), the tree produces apples[i] apples that will spoil after days[i] days. Specifically, any apple grown on day i rots on day $i +$ days[i] and can no longer be consumed on or after that day. On some days, the tree might not yield any apples, represented by apples[i] $= 0$ and days[i] $= 0$.

You can eat at most $1$ apple per day, and you may continue eating apples after the initial n days have elapsed.

Return the maximum number of apples you can eat.

Constraints:

• n $= $ apples.length $= $ days.length

• $1 \leq$ n $\leq 2 imes 10^4$

• $0 \leq$ apples[i], days[i] $\leq 2 imes 10^4$

• days[i] $= 0$ if and only if apples[i] $= 0$

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.