杭电2673--shǎ崽 OrOrOrOrz

shǎ崽 OrOrOrOrz

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7821    Accepted Submission(s): 3735

Problem Description

Acmer in HDU-ACM team are ambitious, especially shǎ崽, he can spend time in Internet bar doing problems overnight. So many girls want to meet and Orz him. But Orz him is not that easy.You must solve this problem first.
The problem is :
Give you a sequence of distinct integers, choose numbers as following : first choose the biggest, then smallest, then second biggest, second smallest etc. Until all the numbers was chosen .
For example, give you 1 2 3 4 5, you should output 5 1 4 2 3

 

 

Input

There are multiple test cases, each case begins with one integer N(1 <= N <= 10000), following N distinct integers.

 

 

Output

Output a sequence of distinct integers described above.

 

 

Sample Input

5 1 2 3 4 5

 

 

Sample Output

5 1 4 2 3

 

 

Author

WhereIsHeroFrom

 

 

Source

HDU女生专场公开赛——谁说女子不如男

 

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2672 2674 2668 1040 1236 

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int num[10010];
int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        for(int i = 0; i < n; i++)
            scanf("%d", &num[i]);
        sort(num, num + n);
        if(n & 1)
        {
            for(int j = 0, i = n-1; i > n/2; j++, i--)
                printf("%d %d ", num[i], num[j]);
            printf("%d
", num[n/2]);
        }
        else
        {
            for(int j = 0, i = n-1; i >= n/2; j++, i--)
            {
                if(j == 0)
                    printf("%d %d", num[i], num[j]);
                else
                    printf(" %d %d", num[i], num[j]);
            }
            printf("
");
        }
    }
    
    return 0;
}