Files
CSCI-1200/lectures/24_priority_queues/min_heap.cpp
2024-04-03 01:59:38 -04:00

21 lines
381 B
C++

#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;
}