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 vote282 views1 answer
Inpout in Array c++
C++
1 vote215 views1 answer
How to set environment variable for c++
C++
0 vote266 views3 answers
Options select from array
C++
0 vote227 views1 answer
Electricity billing system project in c++
C++
0 vote257 views1 answer
How to print items in c++
C++
-1 vote275 views1 answer
? c++
C++
0 vote262 views1 answer
GoPro camera for kids aus
C++
18 votes279 views5 answers
Clear console c++
C++
23 votes273 views1 answer
C++ reverse vector
C++
0 vote270 views1 answer
C++ drop last element of list
C++