You are given two integer arrays, fruits and baskets, each of length n.

• fruits[i] represents the quantity of the $i^{th}$ type of fruit.

• baskets[j] represents the capacity of the $j^{th}$ basket.

Place the fruit types into baskets from left to right using the following rules:

1. Each fruit type must be placed in the leftmost available basket whose capacity is greater than or equal to its quantity.

2. Each basket can hold only one type of fruit.

3. If a fruit type cannot be placed in any available basket, it remains unplaced.

Return the number of fruit types that remain unplaced after all possible allocations are made.

Constraints:

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

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

• $1 \leq$ fruits[i], baskets[i] $\leq 10^3$

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.