【Codeforces 652 B z-sort 】

B. z-sort
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A student of z-school found a kind of sorting called z-sort. The array a with n elements are z-sorted if two conditions hold:

ai ≥ ai - 1 for all even i,
ai ≤ ai - 1 for all odd i > 1. 

For example the arrays [1,2,1,2] and [1,1,1,1] are z-sorted while the array [1,2,3,4] isn’t z-sorted.

Can you make the array z-sorted?
Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array a.

The second line contains n integers ai (1 ≤ ai ≤ 109) — the elements of the array a.
Output

If it’s possible to make the array a z-sorted print n space separated integers ai — the elements after z-sort. Otherwise print the only word “Impossible”.
Examples
Input

4
1 2 2 1

Output

1 2 1 2

Input

5
1 3 2 2 5

Output

1 5 2 3 2

手速题～～

AC代码：

#include<cstdio>
#include<algorithm>
using namespace std;
int na[1010],ans[1010];
int main()
{
    int N;
    while(scanf("%d",&N) != EOF){
        for(int i = 1 ; i <= N ;i++)
            scanf("%d",&na[i]);
        sort(na + 1, na + 1 + N);
        int nl = N;
        for(int i = 2 ; i <= N; i += 2)
            ans[i] = na[nl--];
        for(int i = 1 ; i <= N; i += 2)
            ans[i] = na[nl--];
            for(int i = 1 ; i <= N; i++)
                printf("%d ",ans[i]);
    }
    return 0;
}