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 vote283 views1 answer
Find first of a grammar
C++
5 votes249 views2 answers
Best way to take input in cpp
C++
0 vote254 views1 answer
C++ vector allocator example
C++
0 vote276 views1 answer
High school hacking competition
C++
0 vote286 views1 answer
C++ switch integer
C++
0 vote282 views1 answer
Print elements of linked list
C++
1 vote253 views1 answer
Cpp sample code
C++
2 votes269 views1 answer
Built in function in c++ for binary to decimal
C++
1 vote249 views1 answer
Controlling in windows
C++
1 vote291 views1 answer
Find the graph is minimal spanig tree or not
C++