hdu 2673

来源：互联网发布：应届软件测试面试编辑：程序博客网时间：2024/05/05 07:33

主要就是排序后处理输出

偶数和奇数的情况

#include <iostream>#include <algorithm>                                                                                                                            #include <vector>using namespace std;vector < int > vec;int n, t, x;int main ( ) {    while ( cin >> n ) {        vec.clear ( );        for ( int i = 0; i < n; cin >> x, vec.push_back ( x ), ++i ) ;        sort ( vec.begin ( ), vec.end ( ) );        if ( n % 2 == 0 ) {            for ( int i = 0; i < n / 2; ++i ) {                cout << vec[n - 1 - i] << " " << vec[i];                if ( i == n / 2 - 1 ) cout << endl;                else {                    cout << " ";                }            }        }        else {            for ( int i = 0; i < ( n - 1 ) / 2; ++i )                cout << vec[n - 1 - i] << " " << vec[i] << " ";            cout << vec[(n - 1) / 2] << endl;        }    }}