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 vote145 views1 answer
How to complie c++ to spesific name using terminal
C++
3 votes155 views1 answer
Initialize dynamic array c++ to 0
C++
0 vote145 views1 answer
C++ program for inflation rate of two numbers
C++
12 votes169 views2 answers
Sort in descending order c++
C++
1 vote146 views1 answer
Qt qchar to char
C++
0 vote177 views1 answer
Play audio c++
C++
0 vote157 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++
0 vote149 views1 answer
Sort vector of pair c++
C++
0 vote139 views1 answer
Can derived class access base class non-static members without object of the base class
C++
0 vote169 views1 answer
Program to swap max and min in matrix
C++