优先队列结构体排序

struct node{
	int r,n;
	node (int a,int b):r(a),n(b){}//记住就行
	bool operator < (const node a)const{//重载运算符
		return a.r<r;
	}
};	
priority_queue<node>q;
q.push(node{r,n});