题解 | 排序
排序
https://www.nowcoder.com/practice/dd0c6b26c9e541f5b935047ff4156309
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int c;
vector<int> arr;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> c;
arr.push_back(c);
}
int op;
cin >> op;
if (op == 0) // ascend
sort(arr.begin(), arr.end());
else if (op == 1) //descend
sort(arr.begin(), arr.end(), greater<int>());
for (int c : arr) {
cout << c << " ";
}
return 0;
}
