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 vote250 views2 answers
Dynamic memory allocation c++
C++
0 vote202 views1 answer
No indentation latex
C++
1 vote214 views1 answer
What is time complexity of min_element()
C++
0 vote198 views1 answer
C++98 check if character is integer
C++
0 vote215 views1 answer
Vector c++ length integer
C++
3 votes224 views2 answers
Search in vector of pairs c++
C++
1 vote291 views2 answers
Find the Missing Number
C++
0 vote232 views1 answer
Fabs c c++
C++
-1 vote206 views1 answer
Pointer to constant
C++
0 vote208 views2 answers
Insert image using set atribute
C++