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。

　　

转载于:https://www.cnblogs.com/yiii/p/6233789.html

总结

以上是生活随笔为你收集整理的std::priority_queue的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。