priority_queue: push and size : priority_queue « Queue Stack « C++






  1. C++
  2. Queue Stack
  3. priority_queue

priority_queue: push and size

   
 

#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

 */








Related examples in the same category

1.priority_queue of double
2.priority_queue: push, pop, top, empty
3.priority_queue: pop
4.priority_queue: top
5.Priority Queue Opertions: empty(), pop(), top(), push()
6.Define your function to Prioritize a priority_queue
7.Using a Priority Queue
8.A priority_queue: size(), top(), empty(), pop()