B. Sorted Adjacent Differences Round #633 Div. 2) 排序

You have array of n numbers a1,a2,…,an.

Rearrange these numbers to satisfy |a1−a2|≤|a2−a3|≤…≤|an−1−an|, where |x| denotes absolute value of x. It’s always possible to find such rearrangement.

Note that all numbers in a are not necessarily different. In other words, some numbers of a may be same.

You have to answer independent t test cases.

Input
The first line contains a single integer t (1≤t≤104) — the number of test cases.

The first line of each test case contains single integer n (3≤n≤105) — the length of array a. It is guaranteed that the sum of values of n over all test cases in the input does not exceed 105.

The second line of each test case contains n integers a1,a2,…,an (−109≤ai≤109).

Output
For each test case, print the rearranged version of array a which satisfies given condition. If there are multiple valid rearrangements, print any of them.

Example
input
2
6
5 -2 4 8 6 5
4
8 1 4 2
output
5 5 4 6 8 -2
1 2 4 8
Note
In the first test case, after given rearrangement, |a1−a2|=0≤|a2−a3|=1≤|a3−a4|=2≤|a4−a5|=2≤|a5−a6|=10. There are other possible answers like “5 4 5 6 -2 8”.

In the second test case, after given rearrangement, |a1−a2|=1≤|a2−a3|=2≤|a3−a4|=4. There are other possible answers like “2 4 8 1”.

思路：因为要满足|a1−a2|≤|a2−a3|≤…≤|an−1−an|，所以我们先对数组a排序，后面就可以发现排序后
最小的数减去最大的数的绝对值最大；
其次是最大的数减去第二小的数；
后来就是第二小的数减去减去第二大的数；
以此类推就可以发现只要先输出最中间的数，然后再两边以此取数就可以了。

#include<bits/stdc++.h>
using namespace std;
int a[100010];
int main()
{
    int t; cin>>t;
    while(t--){
        int n; cin>>n;
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        sort(a,a+n);
        if(n%2==1)
            cout<<a[n/2]<<" ";
        for(int i=n/2-1;i>=0;i--){
                cout<<a[n-i-1]<<" "<<a[i]<<" ";
        }
        cout<<endl;
    }
    return 0;
}