Today's Challenge

https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/

Maximum Bags With Full Capacity of Rocks - LeetCode

생각보다 간단한 문제

class Solution:
    def maximumBags(self, capacity: List[int], rocks: List[int], additionalRocks: int) -> int:
        for i in range(len(capacity)):
            capacity[i] -= rocks[i]
        i = 0
        capacity.sort()

        while i < len(capacity) and additionalRocks - capacity[i] >= 0:
            additionalRocks -= capacity[i]
            i += 1
        return i