Maximum Bags With Full Capacity of Rocks LeetCode solution in Python

1
class Solution:
2
    def maximumBags(
3
        self, capacity: List[int], rocks: List[int], additionalRocks: int
4
    ) -> int:
5
        v, c, l = [], 0, len(rocks)
6
        for i in range(l):
7
            p = capacity[i] - rocks[i]
8
            if p > 0:
9
                v.append(p)
10
            else:
11
                c += 1
12
        v.sort()
13
        k = 0
14
        while additionalRocks > 0 and k < len(v):
15
            if v[k] <= additionalRocks:
16
                c += 1
17
                additionalRocks -= v[k]
18
            k += 1
19
        return c