Priority queue smallest first

// C++ program to demonstrate min heap for priority queue
#include <iostream>
#include <queue>
using namespace std;
 
void showpq(
    priority_queue<int, vector<int>, greater<int> > gq)
{
    priority_queue<int, vector<int>, greater<int> > g = gq;
    while (!g.empty()) {
        cout << '\t' << g.top();
        g.pop();
    }
    cout << '\n';
}
 
// Driver Code
int main()
{
    priority_queue<int, vector<int>, greater<int> > gquiz;
    gquiz.push(10);
    gquiz.push(30);
    gquiz.push(20);
    gquiz.push(5);
    gquiz.push(1);
 
    cout << "The priority queue gquiz is : ";
    showpq(gquiz);
 
    cout << "\ngquiz.size() : " << gquiz.size();
    cout << "\ngquiz.top() : " << gquiz.top();
 
    cout << "\ngquiz.pop() : ";
    gquiz.pop();
    showpq(gquiz);
 
    return 0;
}

Source: geeksforgeeks.org

Similar codes

12 votes124 views1 answer
How to sort in descending order c++
C++
0 vote130 views1 answer
C++ insertion in astack
C++
6 votes132 views2 answers
Min heap priority queue c++
C++
0 vote118 views1 answer
Dynamic memory in c++
C++
0 vote115 views1 answer
(1 & 1) in cpp
C++
0 vote126 views2 answers
C++ program to convert time in seconds to hours minutes and seconds
C++
0 vote200 views1 answer
Virtual function c++
C++
0 vote119 views1 answer
How does header files work in c++
C++
2 votes81 views2 answers
Check if array is sorted cpp stl
C++
1 vote123 views3 answers
Array Rotate in c++
C++