C++提高——优先级队列priority_queue

• 最大值优先级队列、最小值优先级队列
• 优先级队列适配器 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,p2; //默认情况下，最大值优先级队列
	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();
	}
}
void main()
{
	main81();
	cout<<"hello..."<<endl;
	system("pause");
	return ;

}

struct cmp1{
	    bool  operator ()  ( int  a , int  b  ){
	   	      return a > b;
	   } 
}; 
struct cmp2{
	   bool operator ()( int s ,int d ){
	   	   return s<d;
	   }
};
priority_queue<int> q;//默认是从大到小

priority_queue<int, vector<int> ,less<int> >q;//从大到小排序

priority_queue<int, vector<int>, greater<int> >q;//从小到大排序

priority_queue < int , vector<int> , cmp2  > q;//从大到小

priority_queue < int , vector<int> , cmp1 > q;//从小到大