HDU shǎ崽 OrOrOrOrz

简单排序

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int cmp(int a,int b)
{
    return a>b;
}

int main()
{
    int n,i,a[10005],ans[10005],flag,flag2,cnt;
    while(cin >> n)
    {


        flag=n/2;
        flag2=n-flag;
        for(i = 0;i<n;i++)
        cin >> a[i];
        sort(a,a+n,cmp);
        cnt=0;
        for(i=0;flag2--;i++){
        ans[cnt]=a[i];
        cnt+=2;
        }
        cnt=1;
        for(i=n-1;flag--;i--){
            ans[cnt]=a[i];
            cnt+=2;
        }
        for(i=0;i<n;i++)
        if(i==n-1)
        cout<<ans[i];
        else
            cout<<ans[i]<<" ";
            cout<<endl;
    }

    return 0;
}

转载于:https://www.cnblogs.com/mingrigongchang/p/6246323.html