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 vote161 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
1 vote146 views1 answer
How to reverse a string in c++ using reverse function
C++
0 vote130 views1 answer
Summation of Natural Number Sequence with c and c++.
C++
0 vote142 views1 answer
Cin does not wait for input
C++
1 vote101 views1 answer
Copy constructor 2d array c++
C++
2 votes243 views1 answer
Gcc run c++
C++
0 vote128 views1 answer
Estimateaffine3d example c++
C++
1 vote129 views1 answer
C++ print vector without loop
C++
0 vote147 views1 answer
Use declaration to define a variable
C++
0 vote141 views1 answer
Template member functions in cpp files
C++