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 vote113 views1 answer
Batch to exe
C++
0 vote132 views2 answers
Float to byte array and back c++ with memcpy command
C++
0 vote158 views1 answer
C++ generic pointer
C++
1 vote106 views1 answer
Visual studio cpp compiler
C++
1 vote115 views1 answer
Binary exponentiation modulo m
C++
1 vote109 views2 answers
Insert vector to end of vector c++
C++
0 vote171 views1 answer
Columntransformer onehotencoder
C++
2 votes92 views3 answers
Selection sort cpp
C++
10 votes109 views2 answers
Check if char in string c++
C++
0 vote99 views1 answer
Sfml disable message
C++