Create The Skyline Problem

Author: Akshat5698

The Skyline Problem

@@ -0,0 +1,36 @@
+class Solution {
+public:
+    vector<vector<int>> getSkyline(vector<vector<int>>& buildings) {
+        int edge_idx = 0;
+        vector<pair<int, int>> edges;
+        priority_queue<pair<int, int>> pq;
+        vector<vector<int>> skyline;
+
+        for (int i = 0; i < buildings.size(); ++i) {
+            const auto &b = buildings[i];
+            edges.emplace_back(b[0], i);
+            edges.emplace_back(b[1], i);
+        }
+
+        std::sort(edges.begin(), edges.end());
+
+        while (edge_idx < edges.size()) {
+            int curr_height;
+            const auto &[curr_x, _] = edges[edge_idx];
+            while (edge_idx < edges.size() &&
+                    curr_x == edges[edge_idx].first) {
+                const auto &[_, building_idx] = edges[edge_idx];
+                const auto &b = buildings[building_idx];
+                if (b[0] == curr_x)
+                    pq.emplace(b[2], b[1]);
+                ++edge_idx;
+            }
+            while (!pq.empty() && pq.top().second <= curr_x)
+                pq.pop();
+            curr_height = pq.empty() ? 0 : pq.top().first;
+            if (skyline.empty() || skyline.back()[1] != curr_height)
+                skyline.push_back({curr_x, curr_height});
+        }
+        return skyline;
+    }
+};