1.6

#include <algorithm>
#include <iostream>
//#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

int main()
{
    /*ios_base::sync_with_stdio(false);
    cin.tie(0);*/
    int arr[10] = {11,2,3,4,5,6,7,9,101,11};
    int arraySize = (sizeof(arr) / sizeof(arr[0]));
    //fill_n(arr, 10, 1);7
    sort(arr, arr + arraySize);
    for (int i = 0; i < arraySize; i++)
    {
        cout << arr[i] << endl;
    }
    //cout << min_element(*arr, 2) << endl;
    reverse(arr, arr + arraySize);
    for (int i = 0; i < arraySize; i++)
    {
        cout << arr[i] << endl;
    }
}