B. Sorted Adjacent Differences (数组构造 / 排序) (Round #633 Div.2)

传送门

题意： 有一个数组，让你对它进行排序，使得

思路： 个人觉得先对其进行排序，然后再max和min这样一 一配对即可。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int t, n, a[N];

signed main()
{
    IOS;

    cin >> t;
    while(t --){
        cin >> n;
        for(int i = 1; i <= n; i ++) cin >> a[i];
        sort(a+1, a+n+1);
        if(n%2){
            cout << a[n/2+1] << " ";
            for(int i = n/2+1, j = 1; i-j; j++)
                cout << a[i+j] << " " << a[i-j] << " ";
        }
        else{
            for(int i = n/2, j = n/2+1; i; i --,j ++)
                cout << a[j] << " " << a[i] << " ";
        }
        cout << endl;
    }

    return 0;
}