優(yōu)先級隊列PRiority_queue

1 最大值優(yōu)先級隊列、最小值優(yōu)先級隊列

2 優(yōu)先級隊列適配器 STL priority_queue

3 用來開發(fā)一些特殊的應用,請對stl的類庫,多做擴展性學習

語法代碼：

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 namespace std;

#include "queue" 

void main81()

{

priority_queue<int> p1; //默認是 最大值優(yōu)先級隊列 

//priority_queue<int, vector<int>, less<int> > p1; //相當于這樣寫

priority_queue<int, vector<int>, greater<int>> p2; //最小值優(yōu)先級隊列

p1.push(33);

p1.push(11);

p1.push(55);

p1.push(22);

cout <<"隊列大小" << p1.size() << endl;

cout <<"隊頭" << p1.top() << endl;

while (p1.size() > 0)

{

cout << p1.top() << " ";

p1.pop();

}

cout << endl;

cout << "測試 最小值優(yōu)先級隊列" << endl;

p2.push(33);

p2.push(11);

p2.push(55);

p2.push(22);

while (p2.size() > 0)

{

cout << p2.top() << " ";

p2.pop();

}

}