STL之優先順序隊列priority_queue

標籤：nbsp   out   deque   優先順序隊列   item   class   while   stream   space   

1.優先順序隊列priority_queue

1）最大值優先順序隊列、最小值優先順序隊列

2）優先順序隊列適配器 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 namespace std;#include "queue" void main81(){    priority_queue<int> p1; //預設是 最大值優先順序隊列     //priority_queue<int, vector<int>, less<int> > p1; //相當於這樣寫    priority_queue<int, vector<int>, greater<int>> p2; //最小值優先順序隊列    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 << "測試 最小值優先順序隊列" << endl;    p2.push(33);    p2.push(11);    p2.push(55);    p2.push(22);    while (p2.size() > 0)    {        cout << p2.top() << " ";        p2.pop();    }}

 

STL之優先順序隊列priority_queue