priority_queue.cpp

标准模板库STL常用代码

#include <queue>

//优先队列是从大到小的顺序
using namespace std;
int main()
{
 priority_queue<int> Q;
 cout<<"1 4 2 8 5 7"<<endl;
  Q.push(1);

  Q.push(4);

  Q.push(2);

  Q.push(8);

  Q.push(5);

  Q.push(7);
  cout<<Q.top()<<" ";
  Q.pop();
    cout<<Q.top()<<" ";
  Q.pop();
      cout<<Q.top()<<" ";
  Q.pop();
        cout<<Q.top()<<" ";
  Q.pop();
          cout<<Q.top()<<" ";
  Q.pop();
  cout<<Q.top()<<endl;

  
 
  
  
 return 0;
}