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 votes167 views3 answers
C plus
C++
0 vote169 views1 answer
Columntransformer onehotencoder
C++
0 vote178 views1 answer
How to change the type of something in c++
C++
-1 vote169 views1 answer
Socket programming in cpp
C++
0 vote183 views1 answer
Cpp pointer to two dimensional array
C++
0 vote163 views1 answer
Explicit conversion casting
C++
1 vote171 views1 answer
Restting a queue stl
C++
0 vote174 views1 answer
Langestpalindromicsubsequence(dp)
C++
0 vote157 views1 answer
Hello world cc++
C++
-1 vote171 views1 answer
I need to write an int function in which there are only cout statements and if I return 0/1 it prints them too.
C++