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 vote329 views1 answer
Youtube backlink generator tool
C++
4 votes292 views3 answers
Static
C++
1 vote317 views1 answer
How to get a letter from the users string in c++
C++
0 vote313 views1 answer
01matrix
C++
0 vote283 views1 answer
Dream speedrun song mp4
C++
1 vote301 views1 answer
Uri online judge 3145 solution in c++
C++
1 vote301 views4 answers
Return function in cpp
C++
0 vote316 views4 answers
Define for loop c++
C++
0 vote334 views2 answers
How can we create 4 digit random number in c++
C++
2 votes305 views1 answer
C++ primality test
C++