std::priority_queue

<from c plus plus>

template <class T, class Container = vector<T>, class Compare = less<typename Container::value_type> > 
class priority_queue;

优先级队列：

　　Priority queues are a type of container adaptors, specifically designed such that its first element is always the greatest of the elements it contains, according to some strict weak ordering criterion.

　　按照优先级顺序排序的 vector。