You are given two integer arrays of length n, named fruits and baskets. Here, fruits[i] denotes the quantity of the $i^{th}$ fruit type, and baskets[j] denotes the capacity of the $j^{th}$ basket.

Starting from the first fruit at index $0$ to the last fruit at index $n - 1$, each fruit is placed into the leftmost available basket whose capacity is greater than or equal to the quantity of that fruit. Once a basket is used, it cannot hold any other fruit. If there is no available basket with sufficient capacity, that fruit remains unplaced.

Return the number of fruits that cannot be placed into any basket.

Constraints:

• n == fruits.length == baskets.length

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

• $1 \le$ fruits[i], baskets[i] $\le 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.