Codeforces Round #541 (Div. 2) C. Birthday(思维)

#include <bits/stdc++.h>
#define ll long long
#define maxn 105
using namespace std;
int n,m;
int pre[maxn], a[maxn];

int main()
{
  cin>>n;
  for(int i=0;i<n;i++) cin>>pre[i];
  sort(pre, pre + n);
  int i = 0, j = 0, k = n - 1;
  while(j < n){
    if(j & 1){
      a[k] = pre[j];
      k --;
    }
    else{
      a[i] = pre[j];
      i ++;
    }
    j ++;
  }
  for(int i=0;i<n;i++){
    cout<<a[i]<<" ";
  }
  return 0;
}