STL Priority Queue Priority_queue

1. Priority Queue Priority_queue

1) Maximum priority queue, minimum priority queue

2) Priority Queue Adapter STL Priority_queue

Priority_queue<int, Deque<int>> PQ;

Priority_queue<int, Vector<int>> PQ;

Pq.empty ()

Pq.size ()

Pq.top ()

Pq.pop ()

Pq.push (item)

#include <iostream>using namespacestd; #include"Queue" voidmain81 () {priority_queue<int> p1;//The default is the maximum priority queue//Priority_queue<int, Vector<int>, less<int> > p1;//It's equivalent to writingpriority_queue<int, vector<int, greater<int>> P2;//Minimum priority queueP1.push ( -); P1.push ( One); P1.push ( -); P1.push ( A); cout<<"Queue Size"<< p1.size () <<Endl; cout<<"Team Head"<< p1.top () <<Endl;  while(P1.size () >0) {cout<< p1.top () <<" ";    P1.pop (); } cout<<Endl; cout<<"Test minimum Priority queue"<<Endl; P2.push ( -); P2.push ( One); P2.push ( -); P2.push ( A);  while(P2.size () >0) {cout<< p2.top () <<" ";    P2.pop (); }}

STL Priority Queue Priority_queue