View Code of Problem 49

#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<string>
#include<cmath>

using namespace std;


int main()
{
	int n;
	cin >> n;

	vector<int> nums(n);
	vector<int> temp(n);
	for (int i = 0; i < n; i++) {

		cin >> nums[i];
		temp[i] = nums[i];
	}

	sort(temp.begin(), temp.end());

	int min = temp[0];
	int max = temp[n - 1];

	swap(temp[0], nums[0]);
	for (int i = 1; i < n; i++) {

		if (nums[i] == min)
			nums[i] = temp[0];
	}

	swap(temp[n - 1], nums[n - 1]);
	for (int i = 0; i < n - 1; i++) {

		if (nums[i] == max)
			nums[i] = temp[n - 1];
	}

	for (int i = 0; i < n; i++) {

		cout << nums[i];

		if (i != n - 1)
			cout << " ";
	}
}