#2279

Maximum Bags With Full Capacity of Rocks

pupil · 590 · lc medium +29 · verified · 68% accepted · 1,768 likes · top 75%

Description

You have n bags numbered 0 to n - 1. Two 0-indexed integer arrays capacity and rocks describe the maximum capacity and current rock count for each bag. You are given an integer additionalRocks.

Distribute the extra rocks freely across the bags. Return the maximum number of bags that can be completely filled.

Example 1:

Input: capacity = [2,3,4,5], rocks = [1,2,4,4], additionalRocks = 2

Output: 3

Explanation:

Place 1 rock in bag 0 and 1 rock in bag 1.

The number of rocks in each bag are now [2,3,4,4].

Bags 0, 1, and 2 have full capacity.

There are 3 bags at full capacity, so we return 3.

It can be shown that it is not possible to have more than 3 bags at full capacity.

Note that there may be other ways of placing the rocks that result in an answer of 3.

Example 2:

Input: capacity = [10,2,2], rocks = [2,2,0], additionalRocks = 100

Output: 3

Explanation:

Place 8 rocks in bag 0 and 2 rocks in bag 2.

The number of rocks in each bag are now [10,2,2].

Bags 0, 1, and 2 have full capacity.

There are 3 bags at full capacity, so we return 3.

It can be shown that it is not possible to have more than 3 bags at full capacity.

Note that we did not use all of the additional rocks.

Code

1

2

3

class Solution:
    def maximumBags(self, capacity: List[int], rocks: List[int], additionalRocks: int) -> int:

class Solution:
    def maximumBags(self, capacity: List[int], rocks: List[int], additionalRocks: int) -> int: