priority_queue: push, pop, top, empty : priority_queue « Queue Stack « C++






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

priority_queue: push, pop, top, empty

   
 


/* The following code example is taken from the book
 * "The C++ Standard Library - A Tutorial and Reference"
 * by Nicolai M. Josuttis, Addison-Wesley, 1999
 *
 * (C) Copyright Nicolai M. Josuttis 1999.
 * Permission to copy, use, modify, sell and distribute this software
 * is granted provided this copyright notice appears in all copies.
 * This software is provided "as is" without express or implied
 * warranty, and with no claim as to its suitability for any purpose.
 */
#include <iostream>
#include <queue>
using namespace std;

int main()
{
    priority_queue<float> q;

    // insert three elements into the priority queue
    q.push(66.6);
    q.push(22.2);
    q.push(44.4);

    // read and print two elements
    cout << q.top() << ' ';
    q.pop();
    cout << q.top() << endl;
    q.pop();

    // insert three more elements
    q.push(11.1);
    q.push(55.5);
    q.push(33.3);

    // skip one element
    q.pop();

    // pop and print remaining elements
    while (!q.empty()) {
        cout << q.top() << ' ';
        q.pop();
    }
    cout << endl;
}
/* 
66.6 44.4
33.3 22.2 11.1

 */








Related examples in the same category

1.priority_queue of double
2.priority_queue: push and size
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()