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 vote327 views1 answer
C++ visual studio 19 how to make colord button from code
C++
20 votes215 views3 answers
C++ open file
C++
1 vote186 views1 answer
Delete a head node in link list
C++
0 vote188 views2 answers
Generating unique id for an object in c++
C++
22 votes392 views2 answers
DateFormat in Flutter
C++
2 votes204 views2 answers
C++ while true loop
C++
0 vote185 views1 answer
C++ cout iostream
C++
0 vote193 views1 answer
16630147
C++
0 vote178 views1 answer
Unknown number of threads cpp
C++
-1 vote191 views2 answers
Number of digits in int c++
C++