priority_queue

#include <bits/stdc++.h>
using namespace std;

//#define int long long
const int INF = 1e18;
const int N = 1e3 + 5;
const int mod = 1e9 + 7;


signed main()
{
    priority_queue<int , vector<int> , greater<int> > q;
    q.push(1);
    q.push(9);
    q.push(5);
    q.push(5);
    q.push(7);
    while(!q.empty()){
        cout << q.top() << endl;
        q.pop();
    }
}