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

38 votes176 views6 answers
How to print hello world in c++
C++
0 vote156 views1 answer
Transpose function example in c++
C++
0 vote159 views1 answer
C++ random number generator uniform distribution
C++
1 vote158 views1 answer
C++ concurrency
C++
0 vote166 views1 answer
Know what the input data is whether integer or not
C++
1 vote165 views1 answer
Qtextedit no line break
C++
2 votes169 views1 answer
Excel vba delete worksheet if exists
C++
1 vote161 views1 answer
Why are inline keyword in header c++
C++
6 votes161 views6 answers
Naruto
C++
0 vote204 views1 answer
Vs Code cpp not run
C++