交叉排序

#include<stdio.h>
#include<algorithm>
int n;
int b[50000],a[50000],c[50000];
int main()
{

    while(~scanf("%d",&n))
    {
        int l=0,p=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            if(i%2==0)
                b[l++]=a[i];
            else
                c[p++]=a[i];
        }
        std::stable_sort(b,b+l);
        std::stable_sort(c,c+p);
        p=0;
        for(int i=1;i<=n;i++)
        {
            if(i%2==0)
                a[i]=b[--l];
            else
                a[i]=c[p++];
        }
        for(int i=1; i<n; i++)
            printf("%d ",a[i]);
        printf("%d\n",a[n]);
    }
    return 0;
}