Apple Redistribution into Boxes
You receive an array apple of size n and an array capacity of size m.
There are n packs where the i^th pack includes apple[i] apples. There are m boxes as well, and the i^th box has a capacity of capacity[i] apples.
Find and provide the minimum count of boxes you need to select to redistribute these n packs of apples into boxes.
Note that, apples from the same pack can be distributed into different boxes.
Input: apple = [1,3,2], capacity = [4,3,1,5,2]
Output: 2
Explanation: We will use boxes with capacities 4 and 5.
It is valid to distribute the apples as the total capacity is greater than or equal to the total count of apples.
Input: apple = [5,5,5], capacity = [2,4,2,7]
Output: 4
Explanation: We will need to use all the boxes.
Constraints
1 <= n == apple.length <= 501 <= m == capacity.length <= 501 <= apple[i], capacity[i] <= 50- The input is generated such that it's possible to redistribute packs of apples into boxes.
Did this problem appear in one of your interviews?
Responses stay private.