renaming

lectures/23_priority_queues/min_heap.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <queue>
+
+int main() {
+    std::priority_queue<int, std::vector<int>, std::greater<int>> minHeap;
+
+    minHeap.push(3);
+    minHeap.push(4);
+    minHeap.push(3);
+    minHeap.push(1);
+    minHeap.push(5);
+
+    while (!minHeap.empty()) {
+        std::cout << minHeap.top() << " ";
+        minHeap.pop();
+    }
+    std::cout << std::endl;
+
+    return 0;
+}