leetcode 3074. Apple Redistribution into Boxes

https://leetcode.com/problems/apple-redistribution-into-boxes/description/

 

class Solution:
    def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:
        total_apple = sum(apple)
        capacity.sort(reverse = True)
        for i in range(len(capacity)):
            if sum(capacity[:i+1]) >= total_apple:
                return i + 1