SDUT1591交叉排序

http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1591&cid=1187

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std ;
int main()
{
    int n ;
    int a[110] ;
    scanf("%d",&n) ;
    for(int i = 0 ; i <= n-1 ; i++)
    scanf("%d",&a[i]) ;
    int sh[100] ;
    int h = 0 ;
    for(int i = 0 ; i <= n-1 ; i += 2)
    {
        sh[h++] = a[i] ;
    }
    int ch[100] ;
    int hh = 0 ;
    for(int i = 1 ;  i <= n-1 ; i += 2)
    ch[hh++] = a[i] ;
    sort(sh,sh+h) ;
    sort(ch,ch+hh) ;
    reverse(ch,ch+hh) ;//一定要先sort一下，因为这个是转置的
    int oo = 0 ;
    for(int i = 0 ; i <= h-1 ; i++){
    a[oo] = sh[i] ;
    oo += 2 ;
    }
    int ooo = 1 ;
    for(int i = 0 ; i <= hh-1 ; i++)
    {
        a[ooo] = ch[i] ;
        ooo += 2 ;
    }
    for(int i = 0 ; i <= n-2 ; i++)
    printf("%d ",a[i]) ;
    printf("%d
",a[n-1]) ;
    return 0 ;
}