C++实现仓库闪点裂隙颜色去重并从大到小排序

```cpp #include <iostream> using namespace std; // 选择排序函数，从大到小排序 void selectionSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { int maxIndex = i; for (int j = i + 1; j < n; j++) { if (arr[j] > arr[maxIndex]) { maxIndex = j; } } if (maxIndex != i) { int temp = arr[i]; arr[i] = arr[maxIndex]; arr[maxIndex] = temp; } } } int main() { int n; cin >> n; int arr[100]; for (int i = 0; i < n; i++) { cin >> arr[i]; } // 调用选择排序函数 selectionSort(arr, n); // 输出去重后的结果 cout << arr[0]; for (int i = 1; i < n; i++) { if (arr[i] != arr[i - 1]) { cout << " " << arr[i]; } } cout << endl; return 0; } ``` ######[AI问答 | 326点数解答 | 2026-02-25 21:51:51]