Code Forces B. Sorted Adjacent Differences

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
inputCopy
2
6
5 -2 4 8 6 5
4
8 1 4 2
outputCopy
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”.

题意：
多实例测试，输入一堆数字，重新排序使得a[1]-a[0]<=a[2]-a[1]<=…<a[i]-a[i-1];
水水水

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1000000 + 7;
int t,n;
int a[N];
int main() {
	scanf("%d", &t);
	while (t--){
		scanf("%d", &n);
		for (int i = 1; i <= n; ++i)
			scanf("%d", a + i);
		sort(a + 1, a + n + 1);
		if (n & 1) printf("%d ", a[n / 2 + 1]);
		for (int i = n / 2; i; --i)
			printf("%d %d ", a[i], a[n - i + 1]);
		printf("\n");
	}
	return 0;
}