priority_queue of double : priority_queue « queue stack « C++ Tutorial






#include <iostream>
using std::cout;
using std::endl;

#include <queue>

int main()
{
   std::priority_queue< double > priorities;
   
   priorities.push( 3.2 );
   priorities.push( 9.8 );
   priorities.push( 5.4 );

   cout << "Popping from priorities: ";
   
   while ( !priorities.empty() ) 
   {
      cout << priorities.top() << ' ';
      priorities.pop();
   }

   cout << endl;
   return 0;
}
Popping from priorities: 9.8 5.4 3.2








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