优先队列

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

struct cmp
{
    bool operator()( const int &a, const int &b )
    {
        return a < b;
    }
};

int main()
{
    //priority_queue< int, vector<int>, greater<int> > q;
    //priority_queue<int> q;
    //priority_queue< int, vector<int>, less<int> > q;
    priority_queue< int, vector<int>, cmp > q;
    int n;
    cin >> n;
    while(n--)
    {
        int cmp;
        cin >> cmp;
        q.push(cmp);
    }
    while(!q.empty())
    {
        cout << q.top() << endl;
        q.pop();
    }
    return 0;
}
//4006