重载运算符

#include<iostream> #include<queue> using namespace std; class node{ public: int x,y,z; node(int a,int b,int c):x(a),y(b),z(c){ } }; bool operator > (const node &a,const node &b){ return a.z>b.z; } int main(){ priority_queue<node,vector<node>,greater<node> > q; q.push(node(1,2,3)); q.push(node(1,2,4)); q.push(node(1,2,7)); q.push(node(1,2,6)); q.push(node(1,2,8)); q.push(node(1,2,0)); while(!q.empty()){ node n=q.top(); cout<<"x="<<n.x<<" y="<<n.y<<" z="<<n.z<<endl; q.pop(); } cout<<endl; return 0; }