algorithm №31

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

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

	vector <int> v(n);
	for (int i = 0; i < n; ++i)
		cin >> v[i];

	vector <int>::iterator it_min = min_element(v.begin(), v.end()),
						   it_max = max_element(v.begin(), v.end());

	if (it_min - v.begin() < it_max - v.begin())
		sort(it_min + 1, it_max);
	else
		reverse(it_max + 1, it_min);

	for (int i = 0; i < n; ++i)
		cout << v[i] << ' ';

	return 0;
}