C++实现：交换数组顺序使首元素存最小值的巧妙解法

```cpp #include <iostream> using namespace std; int main() { int n; cin >> n; int a[100]; for (int i = 0; i < n; i++) { cin >> a[i]; } int minIndex = 0; for (int i = 1; i < n; i++) { if (a[i] < a[minIndex]) { minIndex = i; } } int temp = a[0]; a[0] = a[minIndex]; a[minIndex] = temp; for (int i = 0; i < n; i++) { cout << a[i]; if (i < n - 1) { cout << " "; } } return 0; } ``` ######[AI问答 | 206点数解答 | 2026-02-07 20:24:42]