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 vote303 views1 answer
Char at in c++
C++
0 vote331 views1 answer
C++ little endian or big endian
C++
1 vote307 views1 answer
Binary representation c++
C++
0 vote326 views1 answer
Search a word in cpp file
C++
3 votes283 views1 answer
C++ check if string contains uppercase
C++
0 vote342 views3 answers
Libevent parse multipart formdata site:stackoverflow.com
C++
1 vote312 views1 answer
C++ print variable address
C++
1 vote301 views1 answer
Xmake run with arg
C++
0 vote342 views1 answer
C++ string erase all occurrences
C++
0 vote307 views1 answer
Hash Sort in C++
C++