STL中优先级队列的用法

https://blog.csdn.net/stand1210/article/details/52464922

https://www.cnblogs.com/wangyingli/p/5967127.html

https://www.cnblogs.com/xzxl/p/7266404.html

https://blog.csdn.net/c20182030/article/details/70757660

 

int main() {
    priority_queue<int> pq;
    priority_queue<int, vector<int>, greater<int>> pq1;
    //priority_queue<int, vector<int>> pq1;   输出从大到小
    int a[5] = { 50,12,80,95,112 };
    for (int i = 0; i < 5; i++)
        pq1.push( a[i]);
    for (int i = 0; i < 5; i++)
    {
        cout << pq1.top() << endl;
        pq1.pop();
    }
    system("pause");
    return 0;
}