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>
#include<cstdbool>
using namespace std;


int main()
{
	int n;
	cin >> n;
	int p[100] = {};
	for (int i = 0; i < n; i++) {
		cin >> p[i];
	}
	int min = p[0];
	int xiabiao = 0;
	for (int i = 0; i < n; i++) {
		if (min > p[i]) {
			min = p[i];
			xiabiao = i;
		}
	}
	int temp = p[0];
	p[0] = min;
	p[xiabiao] = temp;
	int max = p[0];
	int xia = 0;
	for (int i = 0; i < n; i++) {
		if (p[i] > max) {
			max = p[i];
			xia = i;
		}
	}
	int t = p[n - 1];
	p[n - 1] = max;
	p[xia] = t;
	for (int i = 0; i < n; i++) {
		if (i != n - 1) {
			cout << p[i] << " ";
		}
		else {
			cout << p[i] << endl;
		}
	}

	return 0;
}