C++ 找出最大的五个传送距离 - 算法题解

#include \n#include \n#include \n\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n vector distances(n);\n for (int i = 0; i < n; i++) {\n cin >> distances[i];\n }\n \n sort(distances.begin(), distances.end(), greater());\n \n int count = min(n, 5);\n for (int i = 0; i < count; i++) {\n cout << distances[i] << " ";\n }\n \n return 0;\n}