priority_queue
empty();
pop();
pop();
push();
- 默认为大顶堆
priority_queue<int> q;
- 仿函数
struct cmp
{
bool operator() (path a, path b)
{
return a.f > b.f;
}
};
empty();
pop();
pop();
push();
priority_queue<int> q;
struct cmp
{
bool operator() (path a, path b)
{
return a.f > b.f;
}
};