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 vote202 views1 answer
Fabs c c++
C++
0 vote171 views1 answer
The iostream is the head er file which contains all the functions of program like cout, cin and etc.
C++
0 vote181 views2 answers
Cplusplusbtutotrail
C++
1 vote192 views1 answer
Print linkedstack cpp
C++
0 vote170 views1 answer
C++ vector declaration
C++
0 vote186 views1 answer
Find N Unique Integers Sum Up to Zero
C++
0 vote201 views1 answer
Concatenate two vectors c++
C++
0 vote197 views1 answer
Honeygain linux
C++
10 votes204 views2 answers
C++ function inside main
C++
1 vote175 views1 answer
Check if whole string is uppercase
C++