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

1 vote187 views3 answers
If c++
C++
0 vote225 views1 answer
Delete array of pointers
C++
0 vote204 views1 answer
Has substr c++
C++
0 vote218 views1 answer
Split string on character vector C++
C++
0 vote184 views1 answer
How can I delete a substring from a string in c++?
C++
2 votes203 views1 answer
How to use winmain function
C++
0 vote217 views1 answer
FlipperRSocketResponder.cpp command failed react native
C++
1 vote201 views1 answer
Perulangan c++
C++
1 vote225 views1 answer
Ray sphere intersection equation
C++
0 vote174 views5 answers
C to c++ code converter
C++