Instantiating an STL priority_queue: a priority queue of integers, doubles, and integers sorted using std::greater <> : priority_queue « queue stack « C++ Tutorial






#include <queue>

int main ()
{
    using namespace std;

    // A priority queue of integers sorted using std::less <> (default)
    priority_queue <int> pqIntegers;

    // A priority queue of doubles
    priority_queue <double> pqDoubles;

    // A priority queue of integers sorted using std::greater <>
    priority_queue <int, deque <int>, greater <int> > pqIntegers_Inverse;

    return 0;
}








21.3.priority_queue
21.3.1.A priority_queue for integers
21.3.2.priority_queue of double
21.3.3.priority_queue: push, pop, top, empty
21.3.4.priority_queue: push and size
21.3.5.priority_queue: pop
21.3.6.Get top() from priority_queue
21.3.7.priority_queue of int: top, pop, empty()
21.3.8.Instantiating an STL priority_queue: a priority queue of integers, doubles, and integers sorted using std::greater <>
21.3.9.priority_queue of int, vector of int and greater
21.3.10.A priority_queue with the Smallest Value at the Front Using a Predicate
21.3.11.priority_queue: top