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

0 vote314 views1 answer
Bit++ codeforces in c++
C++
0 vote322 views1 answer
Bit masking tricks
C++
-1 vote306 views1 answer
Permutation c++
C++
0 vote316 views1 answer
Bit c++
C++
0 vote335 views1 answer
Memset array bool
C++
2 votes298 views2 answers
Run cmd command c++
C++
1 vote302 views1 answer
Forward declaration c++
C++
8 votes317 views2 answers
Cpp print vector
C++
0 vote321 views1 answer
Your age doubled is: xx where x is the users age doubled. (print answer with no decimal places)
C++
0 vote321 views2 answers
Css window id
C++