View Code of Problem 49

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
using namespace std;

int main()
{
	int n;
	cin >>n ;
	int p[20];
	for (int i = 0; i < n; i++) {
		cin >> p[i];
	}
	int min = p[0];
	int mx = 0;
	for (int i = 1; i < n; i++) {
		if (p[i] < min) {
			min = p[i];
			mx = i;
		}
	}
	int temp = p[0];
	p[0] = min;
	p[mx] = temp;



	int max = p[0];
	int maxx = 0;
	for (int i = 1; i < n; i++) {
		if (p[i] > max) {
			max = p[i];
			maxx = i;
		}
	}
	
		
		int temp2 = p[n - 1];
		p[n - 1] = max;
		p[maxx] = temp2;
	
	for (int i = 0; i < n; i++) {
		if (i != n - 1) {
			cout << p[i] << " ";
		}
		else {
			cout << p[i] << endl;
		}
	}
	return 0;
}