<from c plus plus>

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

優(yōu)先級隊列：

　　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.

　　按照優(yōu)先級順序排序的 vector。

　　

轉(zhuǎn)載于:https://www.cnblogs.com/yiii/p/6233789.html

總結(jié)

以上是生活随笔為你收集整理的std::priority_queue的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。