hdu_1.3.4_shǎ崽 OrOrOrOrz

shǎ崽 OrOrOrOrz

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2455 Accepted Submission(s): 828

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

代码：

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<stdio.h>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
using namespace std;//头文件
int main()
{
    int n;
    int num[10000];
    int qian,hou;
    while (cin>>n)
    {


        for (int i=0;i<n;i++)
        {
            cin>>num[i];
        }
        sort(num,num+n);
        qian=0;
        hou=n-1;
        int he=n-1;
        if (n%2==1)
        {
            while (1)
            {

                if (qian!=hou)
                    cout<<num[hou];
                if (qian!=hou)
                    cout<<" ";
                if (qian!=hou)
                    cout<<num[qian];
                if (qian!=hou)
                    cout<<" ";
                qian++;
                hou--;
                if (qian==hou)break;

            }
            cout<<num[qian]<<endl;;
        }
        else
        {
            int ting=n/2;
            while (1)
            {

                if (qian!=hou)
                    cout<<num[hou];
                if (qian!=hou)
                    cout<<" ";
                if (qian!=hou)
                    cout<<num[qian];
                if (qian!=hou&&qian!=ting-1)
                    cout<<" ";
                qian++;
                hou--;
                if (qian==ting)break;

            }
            cout<<endl;

        }


    }
    return 0;

}