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

-1 vote194 views1 answer
Arrays left rotation hackerrank solution
C++
1 vote182 views1 answer
How to send email in c++ program
C++
-1 vote239 views1 answer
C++ how to return an empty vector
C++
1 vote185 views1 answer
If not defined c++
C++
7 votes180 views3 answers
C++ get data type
C++
0 vote189 views1 answer
Log base 2 in c++
C++
0 vote234 views1 answer
How togreper
C++
0 vote179 views1 answer
Can you use rand to read in from an external file inc++
C++
0 vote172 views1 answer
How to get the last element of an array in C++ using std::array
C++
1 vote205 views3 answers
Reverse string c++
C++