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

10 votes295 views3 answers
How to find maximum value in c++
C++
1 vote259 views1 answer
Print std map
C++
0 vote322 views1 answer
Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution
C++
9 votes283 views4 answers
Print vector of vector c++
C++
0 vote301 views1 answer
C++ write number to registry
C++
1 vote276 views2 answers
Rotate in cpp
C++
0 vote269 views1 answer
Typeid to string c++
C++
0 vote311 views10 answers
Loop
C++
5 votes280 views1 answer
How to include everything in c++
C++
0 vote275 views1 answer
Error: ‘memset’ was not declared in this scope in cpp
C++