View Code of Problem 49

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
//#include<algorithm>
#include <iomanip>
using namespace std;
int main() {
	int n;
	cin >> n;
	int max , max_i , min, min_i ;
	int a[10];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		if (i == 0) {
			max = a[0];
			min = a[0];
			min_i = 0;
			max_i = 0;
		}
		else if(a[i] > max) {
			max = a[i];
			max_i = i;
		}
		else if(a[i] < min) {
			min = a[i];
			min_i = i;
		}
	}
    if(max_i == 0 && min_i == n-1) swap(a[0], a[n-1]);
    else
    {
        a[max_i] = a[n - 1];
	a[n - 1] = max;
	//cout << min_i << " " << max_i;
	a[min_i] = a[0];
	a[0] = min;

    }

		for (int i = 0; i < n-1; i++) {
			cout << a[i]<<" ";
		}
		cout << a[n - 1];
}