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 vote156 views1 answer
C++ start thread later
C++
-1 vote147 views1 answer
Window title in c
C++
-2 votes166 views1 answer
Computer vision libraries C++
C++
1 vote162 views1 answer
Iterate vector from end to begin
C++
0 vote193 views1 answer
How to add space in c++
C++
0 vote212 views2 answers
Total sales in array c++ two dimensional array
C++
4 votes175 views2 answers
Gcd recursion c++
C++
4 votes156 views2 answers
Getting a random letter in c++
C++
1 vote155 views1 answer
Sony pictures animation films produced
C++
0 vote156 views1 answer
Size of a matrix c++
C++