#include #include #include

using namespace std;

int main() { int n; cin >> n;

vector<int> distances(n);
for (int i = 0; i < n; i++) {
    cin >> distances[i];
}

sort(distances.begin(), distances.end(), greater<int>());

int count = min(n, 5);
for (int i = 0; i < count; i++) {
    cout << distances[i] << " ";
}
cout << endl;

return 0;

}

C++ 找出最大五个传送距离 - 只用 iostream 库

原文地址: https://www.cveoy.top/t/topic/qwk1 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录