Apple Redistribution into Boxes

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

There are n packs where the i<sup>th</sup> pack contains apple[i] apples. There are m boxes as well, and the i<sup>th</sup> box has a capacity of capacity[i] apples.

Return the minimum number 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.

LeetCode Problem - 3074

class Solution {
    // This method calculates the minimum number of boxes needed to store all the apples given their counts and the capacity of each box.
    public int minimumBoxes(int[] apple, int[] capacity) {
        // Variable to store the total number of apples
        int totalApple = 0;
        // Calculate the total number of apples
        for (int e : apple) {
            totalApple += e;
        }

        // Sort the capacity array in non-decreasing order
        Arrays.sort(capacity);

        // Variables to track the sum of capacities and the number of boxes used
        int sumCapacity = 0, ans = 1;

        // Iterate through the capacities in reverse order (starting from the largest capacity)
        for (int i = capacity.length - 1; i >= 0; i--) {
            // Add the current capacity to the sum
            sumCapacity += capacity[i];
            // If the total capacity accumulated so far is enough to store all the apples, return the current number of boxes used
            if (sumCapacity >= totalApple)
                return ans;
            // Otherwise, increment the number of boxes used
            else
                ans++;
        }

        // If it's impossible to store all the apples, return -1
        return -1;
    }
}