- chenxueze's blog
2039:【例5.6】冒泡排序
- 2024-12-17 18:33:50 @
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,s[1005];
cin >> n;
for (int i = 1;i <= n; i++) {
cin >> s[i];
}
sort(s + 1,s + 1 + n);
for (int i = n; i >= 1; i--) {
cout << s[i] << endl;
}
return 0;
}