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

4 votes312 views1 answer
C++ natural log
C++
0 vote279 views1 answer
Sort deque in c++
C++
-1 vote269 views1 answer
How to insert all values from one vector to another
C++
0 vote294 views1 answer
Uint16_t does not name a type
C++
0 vote300 views1 answer
C++ call overriden method from constructor
C++
1 vote280 views1 answer
Union of two arrays leetcode
C++
0 vote298 views10 answers
Hello world in c++
C++
0 vote291 views1 answer
Are maps sorted c++
C++
-2 votes300 views1 answer
C++ constant
C++
0 vote347 views1 answer
How to cehck if list has element c++
C++