代码

#include<queue>
#include<iostream>
using namespace std;
int main(){
	priority_queue<int, vector<int>, greater<int> > q;
	int a, n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a;
		q.push(a);
	}
	for(int i=1;i<=n;i++){
		cout<<q.top()<<" ";
		q.pop();
	}
	return 0;
}

评测结果