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

6 votes318 views2 answers
How to print a decimal number upto 6 places of decimal in c++
C++
-1 vote314 views6 answers
Wine linux
C++
1 vote324 views1 answer
Binary exponentiation
C++
1 vote292 views1 answer
Stock a file in a vector cpp
C++
0 vote315 views1 answer
Nested loop c++ program example
C++
0 vote285 views1 answer
C++ simple projects
C++
4 votes351 views2 answers
Double max value c++
C++
0 vote307 views1 answer
Delete heap array c
C++
0 vote323 views1 answer
Ds1307 rtc set time
C++
0 vote297 views3 answers
If
C++