1642.-furthest-building-you-can-reach.md

1642. Furthest Building You Can Reach

class Solution:
    def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int:
        q = []
        sum_ = 0
        for i in range(1,len(heights)):
            dis = heights[i] - heights[i - 1]
            if dis > 0 :
                heapq.heappush(q , dis)
                if len(q) > ladders:
                    sum_ += heapq.heappop(q)

                if sum_ > bricks:
                    return i - 1

        return i