[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[][MAX_NUMBER];
 int main()
 {
     //freopen("input.txt","r",stdin);
     int n,tmp,count=,index,flag;
     while(cin>>n && n!=)
     {
         for(int i=;i<n;i++)
         {
             cin>>tmp;
             number[][i]=number[][i]=tmp;
         }
         sort(number[],number[]+n,myfunction1);
         sort(number[],number[]+n,myfunction2);
         index=count=;
         flag=;
         while(index<n && count<n)
         {
             if(flag) cout<<" ";
             if(count<n) {cout<<number[][index];count++;}
             if(count<n) {cout<<" "<<number[][index];index++;count++;}
             flag=;
         }
     }
     return ;
 }