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 vote112 views2 answers
How to create array with not constant size in cpp
C++
2 votes104 views2 answers
Anagram
C++
0 vote108 views3 answers
Iterator in c++
C++
1 vote189 views1 answer
Qt qstring to double
C++
0 vote102 views1 answer
C++ getline doesn't wait for input
C++
1 vote120 views1 answer
Stack implementation using linked list in cpp
C++
6 votes111 views2 answers
Show stack c++
C++
0 vote100 views1 answer
Transpose function example in c++
C++
4 votes130 views1 answer
C++ measure time of function
C++
4 votes116 views1 answer
C++ vector pop_back
C++