priority_queue: push and size : priority_queue « queue stack « C++ Tutorial






  1. C++ Tutorial
  2. queue stack
  3. priority_queue
#include <iostream>
#include <queue>
using namespace std;

int main()
{
  int thedata[] = {45, 34, 56, 27, 71, 50, 62};
  priority_queue<int> pq;  
  cout << "The priority_queue size is now " << pq.size() << endl;
  
  cout << "Pushing 4 elements " << endl;
  for (int i = 0; i < 4; ++i)
    pq.push(thedata[i]);
  cout << "The priority_queue size is now " << pq.size() << endl;
  return 0;
}

The priority_queue size is now 0
Pushing 4 elements
The priority_queue size is now 4




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