sort (STL)

#include <queue>

priority_queue <int> n;
//降序
priority_queue <int, vector<int>, greater<int>  > n;
//升序

n.push()    //入列
n.size()    //返回队列内元素个数
n.top()    //返回队首元素的值
n.pop()    //队首元素出栈
n.back()    //返回队尾元素
q.empty()    //判断队列是否为空(bool)

#include <cstdio>
#include <queue>
using namespace std;

priority_queue <int, vector<int>, greater<int> > n;
int t;

int main()
{
    scanf("%d", &t);
    for(int i = 1; i <= t; i++) 
    {
        int p;
        scanf("%d", &p);
        n.push(p);
    }
    
    while(n.size() != 0)
    {
        int p;
        p = n.top();
        printf("%d ", p);
        n.pop();
    }
    printf("\n");
    return 0;
}