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

2 votes166 views1 answer
What is -> in c++
C++
0 vote159 views1 answer
How initilaize deffult value to c++ class
C++
8 votes174 views2 answers
Built in factorial function in c++
C++
0 vote157 views4 answers
C++ initialize vector of vector with size
C++
1 vote150 views1 answer
Cannot jump from switch statement to this case label c++
C++
0 vote191 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
1 vote176 views1 answer
C++ power
C++
14 votes178 views4 answers
C++ create vector of size
C++
0 vote161 views1 answer
Is obje file binary??
C++
1 vote247 views1 answer
On component end overlap c++
C++