闪点裂隙传送距离排序输出问题的C++实现

```cpp #include <iostream> #include <algorithm> #include <vector> int main() { int n; std::cin >> n; std::vector<int> distances(n); for (int i = 0; i < n; ++i) { std::cin >> distances[i]; } // 从大到小排序 std::sort(distances.begin(), distances.end(), std::greater<int>()); int count = 0; for (int i = 0; i < n && count < 5; ++i) { if (i == 0 || distances[i] != distances[i - 1]) { if (count > 0) { std::cout << " "; } std::cout << distances[i]; ++count; } } std::cout << std::endl; return 0; } ``` ######[AI问答 | 233点数解答 | 2026-02-25 22:00:27]