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 vote339 views2 answers
Sort using comparator anonymous function c++
C++
0 vote332 views1 answer
Syntax of member function in c++
C++
0 vote338 views1 answer
Semi colon in argument list c++
C++
0 vote332 views1 answer
C++ rename function
C++
0 vote335 views1 answer
Static cast char c++
C++
0 vote344 views1 answer
Character convert c++
C++
0 vote343 views1 answer
Linux x11 copy paste event
C++
0 vote327 views1 answer
Size of a matrix c++
C++
1 vote324 views1 answer
Cpp float to string
C++
0 vote434 views1 answer
Find number of 1s in a binary cv::mat image
C++