1642. Furthest Building You Can Reach

class Solution {
public:
    int furthestBuilding(vector<int>& heights, int bricks, int l) {
        int n=heights.size();
        int i=0;
        priority_queue<int>q;
        for(i;i<n-1;i++){
            if(heights[i+1]<=heights[i]){
                continue;
            }
            int d=heights[i+1]-heights[i];
            if(d<=bricks){
                bricks-=d;
                q.push(d);
            }
            else if(l>0){
                if(q.size()){
                    int x=q.top();
                    if(x>d){
                        bricks+=x;
                        q.pop();
                        q.push(d);
                        bricks-=d;
                    }
                }
                l--;
            }
            else break;
            }
            return i; 

        }
               
    
};