A priority_queue: size(), top(), empty(), pop() : priority_queue « Queue Stack « C++






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

A priority_queue: size(), top(), empty(), pop()

  
#include <queue>
#include <iostream>

int main ()
{
    using namespace std;

    priority_queue <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 << "Deleting the topmost element: " << pqIntegers.top ();
        cout << endl;

        pqIntegers.pop ();
    }

    return 0;
}








Related examples in the same category

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