A priority_queue with the Smallest Value at the Front Using a Predicate : priority_queue « queue stack « C++ Tutorial

1. C++ Tutorial
2. queue stack
3. priority_queue

#include <queue>
#include <iostream>

int main ()
{
    using namespace std;

    priority_queue <int, vector <int>, greater <int> > pqIntegers;

    pqIntegers.push (10);
    pqIntegers.push (5);
    pqIntegers.push (-1);
    pqIntegers.push (20);

    cout << "The queue contains " << pqIntegers.size () << " elements";
    cout << endl;
    cout << "Element at the top: " << pqIntegers.top () << endl << endl;

    while (!pqIntegers.empty ())
    {
        cout << "pop the topmost element " << pqIntegers.top ();

        pqIntegers.pop ();
    }

    return 0;
}