#include <cstdio>

 #include <iostream>

 #include <queue>

 using namespace std;

 // 默认是最大堆

 //

 int main()

 {

     priority_queue<int> heap;

     heap.push();

     heap.push();

     heap.push();

     heap.push();

     while(!heap.empty())

     {

         cout<<heap.top()<<endl;

         heap.pop();

     }

     // 如何实现最小堆？

     priority_queue<int,vector<int>,greater<int>> heap2;

     heap2.push();

     heap2.push();

     heap2.push();

     heap2.push();

     heap2.push();

     while(!heap2.empty())

     {

         cout<<heap2.top()<<endl;

         heap2.pop();

     }

     return ;

 }