STL:priority_queue
#include<queue>
pritority<int>q;(大根堆)
priority_queue<int,vector<int>,greater<int> >q;(小根堆)
struct
no{
int
x,v;
bool
operator <(
const
no &T)
const
{
return
v>T.v;}
};
queue<no>q;
#include<queue>
pritority<int>q;(大根堆)
priority_queue<int,vector<int>,greater<int> >q;(小根堆)
struct
no{
int
x,v;
bool
operator <(
const
no &T)
const
{
return
v>T.v;}
};
queue<no>q;