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 vote238 views1 answer
Iteraate through a vector
C++
3 votes238 views1 answer
How to find the suarray with maximum sum using divide and conquer
C++
0 vote238 views1 answer
How to have a queue as a parameter in c++
C++
0 vote218 views2 answers
Use c++17 g++
C++
5 votes269 views2 answers
Return multiple values c++
C++
0 vote251 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote240 views1 answer
Get rest of a stringstream c++
C++
0 vote236 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++
4 votes220 views2 answers
Max_element c++
C++
8 votes246 views2 answers
C++ factorial
C++