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 vote127 views1 answer
Binary algebra cpp
C++
-1 vote124 views1 answer
Pointer to constant
C++
0 vote116 views1 answer
41.00
C++
0 vote123 views1 answer
Creating node in c++
C++
0 vote118 views1 answer
Finding nth most rare element code in c++
C++
3 votes123 views2 answers
Define and show the implementation of the functions of an arrayList.
C++
0 vote134 views1 answer
Yearly interest calculator c++ using for loop
C++
1 vote119 views2 answers
Ue4 c++ enumaeration
C++
1 vote123 views3 answers
If c++
C++
0 vote124 views2 answers
How to set arrays as function parameters in c++
C++