#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int aa[100009];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> aa[i];
}
sort(aa, aa + n);
for (int i = 0; i < n-1; i++) {
cout << aa[i] << " ";
}
cout << aa[n-1] << endl;
}
啊这.......我还说为啥代码这么简介呢
你直接调用 STL 里的排序函数了。。。