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

5 votes237 views3 answers
C++ random number within range
C++
0 vote268 views1 answer
C++ program transpose of matrix
C++
5 votes255 views10 answers
Array
C++
-1 vote201 views1 answer
Execute executable in c++
C++
0 vote278 views1 answer
Use declaration to define a variable
C++
0 vote248 views1 answer
Google pdf iframe viwer
C++
0 vote297 views1 answer
Print stack without pop c++
C++
0 vote235 views1 answer
C++ print binary treenode
C++
1 vote281 views1 answer
Priority queue ordered by second element
C++
1 vote262 views1 answer
Heap c++ stl
C++