STL中的优先队列 priority_queue (堆)

 注意：

1、友元函数运算符重载；

2、堆的优先级的设置。

#include<iostream>
#include<queue>
using namespace std;

struct fruit
{
	string name;
	int price;
	friend bool operator < (const fruit &f1,const fruit &f2) 
	{
		return f1.price>f2.price;
	}
}f1,f2,f3;
/*
struct cmp
{
	bool operator ()(fruit f1,fruit f2)
	{
		return f1.price>f2.price;
	}
};
*/

int main()
{
	//priority_queue<int> q;	
	//priority_queue<int,vector<int>,less<int> > q; 
	
	priority_queue<fruit,vector<fruit>,less<fruit> > q;  //貌似只能写less，greater<fruit>报错。 
	
	f1.name="桃子";
	f1.price=3;
	f2.name="栗子";
	f2.price=4;
	f3.name="苹果";
	f3.price=1;
	
	q.push(f1);
	q.push(f2);
	q.push(f3); 
		
	cout<<q.top().name<<" "<<q.top().price<<endl;
	
	/*
	priority_queue<int,vector<int>,greater<int> > q; 
	
	q.push(3);
	q.push(4);
	q.push(1);
	
	cout<<q.top();
	*/
	
	return 0;
}