1642. Furthest Building You Can Reach

class Solution {
    public int furthestBuilding(int[] heights, int bricks, int ladders) {
        PriorityQueue<Integer> minHeap = new PriorityQueue<>();

        for (int i = 0; i < heights.length - 1; i++) {
            int diff = heights[i + 1] - heights[i];
            
            if (diff > 0) {
               
                minHeap.add(diff);
            }
            
           
            if (minHeap.size() > ladders) {
                bricks -= minHeap.poll();
            }
            
           
            if (bricks < 0) {
                return i;
            }
        }
        
       
        return heights.length - 1;
    }
}