优先队列
优先队列重载,记得优先队列是反着的,后面那个才是堆顶
struct cmp1{
bool operator()(int x,int y){
return x>y;
}
};
struct cmp2{
bool operator()(pii x,pii y){
return x.fir<y.fir;
}
};
struct node{
int x,y;
friend bool operator <(node a,node b){
return a.x>b.x;
}
};
priority_queue <int ,vector<int> ,cmp1> q;
priority_queue <pii ,vector<pii> ,cmp2> q2;
priority_queue<node> q3;