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 vote253 views1 answer
C++ static array in Klasse
C++
0 vote254 views1 answer
Cout.flush() in c++
C++
0 vote264 views1 answer
Sento freddo a un dente
C++
0 vote291 views1 answer
C++ fibo
C++
0 vote274 views1 answer
Pca compact trick
C++
3 votes301 views2 answers
C++ map insert
C++
70 votes355 views5 answers
Erase element from vector c++
C++
0 vote233 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
0 vote253 views1 answer
User inptu in cpp
C++
0 vote256 views3 answers
Onoverlapbegin ue4 c++
C++