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 vote193 views1 answer
C++ sorting and keeping track of indexes
C++
6 votes181 views3 answers
How to kill
C++
0 vote191 views1 answer
C++ call overriden method from constructor
C++
0 vote206 views1 answer
Iterate const vector
C++
8 votes208 views3 answers
Sum elements in vector c++
C++
1 vote180 views1 answer
What is the associative property of an operator
C++
0 vote199 views1 answer
C++ fill array with 0
C++
1 vote220 views1 answer
Find the graph is minimal spanig tree or not
C++
75 votes271 views6 answers
Conda list envs
C++
0 vote260 views1 answer
How togreper
C++