C++实现冒泡排序从大到小排序并去重

```cpp #include <iostream> using namespace std; int main() { int n; cin >> n; int arr[100]; for (int i = 0; i < n; i++) { cin >> arr[i]; } // 冒泡排序 for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] < arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } // 去重并输出 cout << arr[0]; for (int i = 1; i < n; i++) { if (arr[i] != arr[i - 1]) { cout << " " << arr[i]; } } cout << endl; return 0; } ``` ######[AI问答 | 266点数解答 | 2026-02-25 22:18:16]