priority_queue of int: top, pop, empty() : priority_queue « queue stack « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » queue stack » priority_queue

21.3.7.priority_queue of int: top, pop, empty()

#include <queue>

#include <iostream>

using namespace std;



int main(int argc, char** argv)

{

  priority_queue<int> myQueue;



  myQueue.push(3);

  myQueue.push(4);

  myQueue.push(2);

  myQueue.push(1);



  while (!myQueue.empty()) {

    cout << myQueue.top() << endl;

    myQueue.pop();

  }



  return (0);

}

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

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.