优先队列关于重载运算符，解决结构体优先级设置问题的相关代码

#include<iostream>
#include<map>
#include<set>
#include<cstdio>
#include<string>
#include<queue>
using namespace std;
struct fr
{
  string name;
  int p;
  friend bool operator < (fr f1,fr f2)
  {
  	return f1.p > f2.p;
  }	
}f1,f2,f3;
int main()
{
	priority_queue<fr>q;
	f1.name="桃子";
	f2.name="梨子";
	f3.name="苹果";
	f1.p=3;
	f2.p=4;
	f3.p=1;
	q.push(f1);
	q.push(f2);
	q.push(f3);
	cout<<q.top().name<<q.top().p<<endl;
	 
}