C++ 找出最大五个数：闪点裂隙传送距离排序算法

#include #include #include

using namespace std;

int main() { int n; cin >> n; vector distances(n); for (int i = 0; i < n; i++) { cin >> distances[i]; } sort(distances.rbegin(), distances.rend()); int output_size = min(n, 5); for (int i = 0; i < output_size; i++) { cout << distances[i] << ' '; } cout << endl; return 0; }