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 vote221 views1 answer
Error c4001 site:docs.microsoft.com
C++
2 votes229 views6 answers
Loop in c++
C++
0 vote233 views1 answer
How to use getline function inc
C++
0 vote240 views1 answer
Cpp concatenate methods
C++
0 vote225 views1 answer
Glm has no member value_ptr
C++
1 vote242 views1 answer
Priority queue ordered by second element
C++
0 vote214 views3 answers
Best gun in freefire for headshot
C++
0 vote237 views1 answer
"StepFileGen1." cpp.o failed jetson nano
C++
0 vote212 views1 answer
Windows install cppcheck
C++
19 votes234 views1 answer
How to output to a file in c++
C++