优先队列比较符重载

#include <iostream>
#include <queue>
using namespace std;
struct Node{
	int x, y;
	friend bool operator<(Node a, Node b){
		return a.x > b.x; //x最小的节点在队首
	}
};

int main(){
	priority_queue<Node> PQ;
	Node temp = {2, 3};
	PQ.push(temp);
	temp.x = 4; temp.y = 6;
	PQ.push(temp);
	temp.x = 3; temp.y = 6;
	PQ.push(temp);
	while(!PQ.empty()){
		cout << PQ.top().x << ' ' << PQ.top().y << endl;
		PQ.pop();
	}
	return 0;
}
/*
**output:
2 3
3 6
4 6

--------------------------------
Process exited with return value 0
Press any key to continue . . .

*/

优先队列比较符重载,布布扣,bubuko.com

优先队列比较符重载

原文：http://blog.csdn.net/chang_mu/article/details/30710301