[acm]HDOJ 2673 shǎ崽 OrOrOrOrz

题目地址：

http://acm.hdu.edu.cn/showproblem.php?pid=2673

拍两次序，交替输出

---

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define MAX_NUMBER 10000
bool myfunction1 (int i,int j) { return (i<j); }
bool myfunction2 (int i,int j) { return (i>j); }
int number[2][MAX_NUMBER];
int main()
{
    //freopen("input.txt","r",stdin);
    int n,tmp,count=0,index,flag;
    while(cin>>n && n!=0)
    {
        for(int i=0;i<n;i++)
        {
            cin>>tmp;
            number[0][i]=number[1][i]=tmp;
        }
        sort(number[0],number[0]+n,myfunction1);
        sort(number[1],number[1]+n,myfunction2);
        index=count=0;
        flag=0;
        while(index<n && count<n)
        {
            if(flag) cout<<" ";
            if(count<n) {cout<<number[1][index];count++;}
            if(count<n) {cout<<" "<<number[0][index];index++;count++;}
            flag=1;
        }
    }
    return 0;
}