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 vote198 views1 answer
C++ excel cell blank cells
C++
1 vote166 views1 answer
Iterating string in cpp
C++
5 votes153 views1 answer
C++ - include all libraries
C++
1 vote219 views1 answer
C++ directory listing
C++
26 votes213 views1 answer
Delete specific vector element c++
C++
0 vote170 views1 answer
C++ pass char array by reference
C++
0 vote171 views1 answer
Setting a number of decimals on a float on C++
C++
1 vote177 views1 answer
Parallelize for loop c++
C++
0 vote164 views1 answer
SET TO NULL pointer c++
C++
1 vote250 views2 answers
Maximum value in map in c++
C++