# codeforces 652 B. z-sort (简单构造)

Posted by 111qqz on Thursday, March 31, 2016

## TOC

``````/* ***********************************************
Author :111qqz
Created Time :2016年03月31日 星期四 14时05分11秒
File Name :code/cf/problem/652B.cpp
************************************************ */

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long LL;
#define pi pair < int ,int >
#define MP make_pair

using namespace std;
const double eps = 1E-8;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
const int inf = 0x3f3f3f3f;
const int N=1E3+7;
int a[N];
int ans[N];
int n ;
int main()
{
#ifndef  ONLINE_JUDGE
freopen("code/in.txt","r",stdin);
#endif

cin>>n;
for ( int i = 1 ; i  <= n ; i++) cin>>a[i];
sort(a+1,a+n+1);
int cnt = 0  ;
for ( int i = 1 ; i <= n ; i+=2)
{
ans[i] = a[++cnt];
}

for ( int i = n/2*2 ; i >= 1 ; i-=2)
{
ans[i] = a[++cnt];
}

for ( int i = 1 ; i < n ; i++) cout<<ans[i]<<" ";
cout<<ans[n]<<endl;

#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
``````

「真诚赞赏，手留余香」