hdu 2673

来源：互联网发布：千牛设置淘宝分流编辑：程序博客网时间：2024/05/23 19:17

/** hdu OrOrOrOrz* date 2014/5/13* state AC*/#include <iostream>#include <algorithm>#include <fstream>#include <cstring>using namespace std;const int MAXN=10000;int Arr[MAXN];int main(){    //cout << "Hello world!" << endl;    //freopen("input.txt","r",stdin);    int N;    while(scanf("%d",&N)!=EOF)    {        memset(Arr,0,sizeof(Arr));        for(int i=0;i<N;i++)        {            cin>>Arr[i];        }        sort(Arr,Arr+N);        //for(int i=0;i<=N/2;i++)        int i=0,j=N-1;        if(N%2!=0)//n为奇数情况        {            while(j>i)            {                 printf("%d %d ",Arr[j],Arr[i]);                 i++;                 j--;            }            printf("%d\n",Arr[i]);        }        else//n为偶数情况        {            while(j-i>1)            {                printf("%d %d ",Arr[j],Arr[i]);                i++;                j--;            }            printf("%d %d\n",Arr[j],Arr[i]);        }        //cout<<endl;    }    return 0;}

参考

#include <iostream>#include <vector>#include <algorithm>using namespace std;int main(){    int N,num,low,high,Size;    vector<int> numSeq;    while(cin>>N)    {        Size = N;        numSeq.clear();        while(N--)        {cin>>num;numSeq.push_back(num);}        sort(numSeq.begin(),numSeq.end());        low=0;high=numSeq.size()-1;        <strong>while(low<high)        {            cout<<numSeq[high]<<" "<<numSeq[low]<<" ";            ++low;--high;            if(Size&0x1)//奇数            {                if(low==high)                {cout<<numSeq[low]<<endl;break;}            }            else            {                if((low+1)==high)                {cout<<numSeq[high]<<" "<<numSeq[low]<<endl;break;}            }        }</strong>    }    return 0;}

0 0