#include <iostream>

#include <cstdio>

#include <queue>

using namespace std;

int main()

{

    // 默认定义最大值优先级队列

    priority_queue<int> p1;

    p1.push();

    p1.push();

    p1.push();

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

    p1.pop();

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

    // 最小值优先级队列

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

    p2.push();

    p2.push();

    p2.push();

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

    p2.pop();

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

    return ;

}