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 vote107 views1 answer
Public method
C++
-1 vote111 views1 answer
A[12] = h + A[8]
C++
0 vote108 views1 answer
Double array size c++
C++
1 vote120 views3 answers
Python ord()
C++
1 vote106 views1 answer
Whole size of the internet
C++
0 vote126 views1 answer
Cin does not wait for input
C++
0 vote136 views1 answer
C++ standard library source
C++
0 vote69 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
5 votes116 views1 answer
Flutter margins
C++
0 vote120 views1 answer
Cuda atomic swap
C++