name: Енц Михаил, problem: e08, submit: 246582

----------------------------------------------------

#include < iostream >

using namespace std;

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

        int maxItem = -1000000001;
        int minItem  = 1000000001;
        int mas[20001];
        int left  = 0;
        int right = 0;

        for (int i = 0; i < total; i++)
        {
                cin >> mas[i];
                if (mas[i] >= maxItem)
                {
                        maxItem = mas[i];
                        right = i;
                }
                if (mas[i] < minItem)
                {
                        minItem = mas[i];
                        left = i;
                }
        }

        for (int i = 0; i < min(left, right); i++)
                cout << mas[i] << " ";

        for (int i = max(right, left); i >= min(left, right); i--)
                cout << mas[i] << " ";

        for (int i = max(right, left) + 1; i < total; i++)
                cout << mas[i] << " ";

        return 0;
}


name: Енц Михаил, problem: e09, submit: 249144

----------------------------------------------------

#include <iostream>
#include <cmath>
#include <iomanip>

using namespace std;
int N[100000];
int A[200000];
int C[200000];

int main()
{
    int n;
	cin >> n;
	for (int i = 0;i < n;i++)
		cin >> A[i];

	for (int i = 0;i < n;i++)
		C[i] = A[i];

	int m = 0,k = 0;
	for (int i = 0;i < n;i++)
		if (A[i]!=1)
			m++;
	for (int i = 0;i < m;i++)
		C[k++] = 0;
	for (int i = 0;i < n-m;i++)
		C[k++] = 1;





	int u = 0;
	for (int i = 0;i<n;i++)
		if (A[i] != C[i])
			u++;
	cout << u/2;

			  return 0;
}