Solution as on 27-11-2021 10:30 pm

Author: knockcat

1642. Furthest Building You Can Reach.cpp

@@ -0,0 +1,30 @@
+// 1642.✅ Furthest Building You Can Reach
+
+class Solution
+{
+public:
+    int furthestBuilding(vector<int> &heights, int bricks, int ladders)
+    {
+        priority_queue<int> pq;
+
+        int i = 0;
+        for (i = 0; i < heights.size() - 1; ++i)
+        {
+            int diff = heights[i + 1] - heights[i];
+            if (diff <= 0)
+                continue;
+            bricks -= diff;
+            pq.push(diff);
+            if (bricks < 0)
+            {
+                bricks += pq.top();
+                pq.pop();
+                --ladders;
+            }
+            if (ladders < 0)
+                break;
+        }
+
+        return i;
+    }
+};