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

46 votes166 views3 answers
All data types in C++
C++
7 votes155 views6 answers
Sort a vector c++
C++
0 vote138 views1 answer
Gcc suppress warning inline
C++
0 vote135 views1 answer
How to take continuous input in c++ until any value. Like for example(taking input until giving q)
C++
0 vote128 views1 answer
Glew32.dll was not found
C++
1 vote147 views1 answer
Std means in programming
C++
0 vote159 views1 answer
Tabeau dynamique c++
C++
1 vote145 views1 answer
Std::tuple apply multiplier
C++
7 votes129 views5 answers
Stack in c++
C++
0 vote133 views1 answer
InstallUtil.exe ConsoleApp
C++