You are given two integer arrays capacity and rocks, each of length n, along with an integer additionalRocks.

For each bag i, capacity[i] represents its total rock capacity, and rocks[i] represents the quantity of rocks currently inside it. You have additionalRocks more rocks that you can distribute among any of the bags.

Return the maximum count of bags that can reach full capacity after placing the additional rocks.

Constraints:

• n $=$ capacity.length $=$ rocks.length

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

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

• $0 \leq$ rocks[i] $\leq$ capacity[i]

• $1 \leq$ additionalRocks $\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.