HDU 2673 （排序）

最新推荐文章于 2023-09-07 11:34:14 发布

转载最新推荐文章于 2023-09-07 11:34:14 发布 · 156 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Roni-i/p/7211435.html

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

InputThere are multiple test cases, each case begins with one integer N(1 <= N <= 10000), following N distinct integers.OutputOutput a sequence of distinct integers described above.Sample Input

5
1 2 3 4 5

Sample Output

5 1 4 2 3

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;

int main(){
    int a[10000],n,i,j;
    while(~scanf("%d",&n)){
        for(i=0;i<n;++i)
            scanf("%d",&a[i]);
        sort(a,a+n);
        i=0;//！！
        j=n-1;
        while(i<j){
            printf("%d %d",a[j],a[i]);
            if(i+1!=j)printf(" ");
            ++i;
            --j;//从两变填入
        }
        if(i==j)printf("%d",a[i]);
        printf("\n");
    }
    return 0;
}

转载于:https://www.cnblogs.com/Roni-i/p/7211435.html