优先队列

1.结构体优先队列

struct node{
int x;
int y;
int d;
friend bool operator< (node a,node b)
    {
        return a.d>b.d;//小的在前
    }
};

    priority_queue<number1>que5; 

2.普通优先

struct cmp1{  
    bool operator ()(int &a,int &b){  
        return a>b;//最小值优先  
    }  
};  

priority_queue<int>que;//采用默认优先级构造队列 默认从大到小 
  
    priority_queue<int,vector<int>,cmp1>que1;//最小值优先  
    priority_queue<int,vector<int>,cmp2>que2;//最大值优先