C++ 算法：交换数组最小值和最大值

#include #include using namespace std; const int N = 15; int a[N]; int main() { int n, maxn = -1, minn = 0x3f3f3f3f, pmax, pmin; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; if (a[i] > maxn) { maxn = a[i]; pmax = i; } if (a[i] < minn) { minn = a[i]; pmin = i; } } swap(a[pmin], a[0]); swap(a[pmax], a[n - 1]); for (int i = 0; i < n - 1; i++) cout << a[i] << ' ';
cout << a[n - 1] << endl; return 0; }