题解 | 互换最大最小数

#include <bits/stdc++.h>
using namespace std;


int main() {
    int n;
    while (cin >> n) {
        int a[n];
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        int max = a[0], k1 = 0;
        for (int i = 0; i < n; i++) {
            if (a[i] >= max) {
                max = a[i];
                k1 = i;
            }
        }
        int min = a[0], k2 = 0;
        for (int i = 0; i < n; i++) {
            if (a[i] <= min) {
                min = a[i];
                k2 = i;
            }
        }
        a[k1] = min;
        a[k2] = max;
        for (int i = 0; i < n; i++)cout << a[i] << " ";
        cout << endl;
    }
}

单纯搜