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 vote317 views1 answer
Number of characters in string
C++
0 vote325 views1 answer
Greater <pair<int,int>>
C++
13 votes248 views27 answers
Cpp hello
C++
0 vote337 views1 answer
Sort vector of pair c++
C++
1 vote326 views2 answers
Cvtcolor rgb to gray
C++
0 vote325 views1 answer
C++ pointer to base class
C++
1 vote324 views1 answer
Eosio require_find
C++
0 vote335 views1 answer
Int a=0; int b=30;
C++
1 vote348 views1 answer
Cpp goiver all the map values
C++
1 vote314 views1 answer
C++ hide cursor
C++