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 vote155 views1 answer
Select one random element of a vector in c++
C++
0 vote156 views1 answer
What is a ~ in c++
C++
0 vote146 views1 answer
Programs using vectors in c++
C++
0 vote147 views1 answer
Ex: cpp
C++
0 vote104 views1 answer
Postorder traversal calculator
C++
0 vote187 views1 answer
"++i + ++i" explanation
C++
0 vote170 views2 answers
How can we create 4 digit random number in c++
C++
0 vote141 views1 answer
Error c4001 site:docs.microsoft.com
C++
0 vote163 views1 answer
C++ localtime unsafe
C++
0 vote149 views1 answer
I++ and++i
C++