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 vote107 views1 answer
Generate random string in c++
C++
101 votes219 views6 answers
How to turn int into string c++
C++
5 votes106 views1 answer
How to disable buttons in unity
C++
0 vote96 views1 answer
Constructor syntax in c++
C++
0 vote97 views1 answer
Balanced brackets in c++
C++
7 votes100 views6 answers
Iterate through map
C++
5 votes95 views2 answers
Sleep c++ windows
C++
7 votes99 views1 answer
Migration meaning
C++
1 vote123 views1 answer
How to substract to give a positive outcome in c++
C++
1 vote122 views1 answer
Can you verify adsense no ssl certificate
C++