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 votes178 views1 answer
Cpp iterator of element
C++
3 votes185 views1 answer
Library imported for stl
C++
0 vote192 views1 answer
Lambda function qt connect
C++
0 vote191 views1 answer
How to create a c++ templeate
C++
0 vote178 views1 answer
C++ Syntax
C++
0 vote192 views1 answer
Play sound opencv video c++
C++
0 vote175 views1 answer
Math in section title latex
C++
1 vote183 views1 answer
System cpp
C++
0 vote201 views1 answer
How to merge string array in C++
C++
0 vote191 views1 answer
How to get max grade c++
C++