交叉排序

#include <iostream>

using namespace std;

int main()
{
    int a[100];
    int i, j, n, t;
    cin >> n;
    for(i=1; i<=n; i++)
        cin >> a[i];
    for(i=1; i<=n; i++)
        for(j=i+2; j<=n; j+= 2)
            if(i%2 == 1 && a[i] > a[j] || i%2 == 0 && a[i] < a[j])
            {
                t = a[i];
                a[i] = a[j];
                a[j] = t;
            }
    cout << a[1];
    for(i=2; i<=n; i++)
        cout << " " << a[i];
    cout << endl;
    return 0;
}