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 vote177 views1 answer
Power of two c++
C++
0 vote186 views1 answer
How to cehck if list has element c++
C++
0 vote150 views1 answer
Backward chaining python
C++
0 vote140 views1 answer
Character cin(userInput) in c++
C++
0 vote144 views1 answer
C++ allocate and free dynamic 2d array
C++
0 vote139 views1 answer
Sleep system function linux c++
C++
11 votes138 views3 answers
C++ map iterator
C++
1 vote144 views1 answer
Print all chrchetrs of a string c++
C++
0 vote156 views1 answer
C++ asio read full socket data into buffer
C++
0 vote135 views1 answer
Get type of variable in c++
C++