eolymp
bolt
Try our new interface for solving problems
published at 4/15/24, 1:48:31 pm

include <iostream>

include <vector>

include <algorithm>

using namespace std;

int main() { int n,k=1; cin >> n; int f[n];

for (int i = 0; i < n; i++) {
    cin >> f[i];
}
sort(f,f+n);
vector <int> vec;
vec.push_back(f[n-1]);
if(n%2==0){
    k++;
}

for (int i=n-2;i>=0;i--){ if(k%2==1){ vec.push_back(f[i]); } else{ vec.insert(vec.begin(),f[i]); } k++; } for(int i=0;i<vec.size();i++){ cout<<vec[i]<<" "; } return 0; }