You are given an array apple of size n and an array capacity of size m.

There are n packs of apples, where the $i$-th pack contains apple[i] apples. There are also m boxes available, where the $i$-th box can hold up to capacity[i] apples.

Return the minimum number of boxes needed to redistribute all the apples. Apples from the same pack can be split and placed into different boxes.

Constraints:

• $1 \leq n ==$ apple.length $\leq 50$

• $1 \leq m ==$ capacity.length $\leq 50$

• $1 \leq$ apple[i], capacity[i] $\leq 50$

• The input is generated such that it is always possible to redistribute the packs of apples into the boxes.

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.