Codeforces Round #633 (Div. 2) B. Sorted Adjacent Differences

B. Sorted Adjacent Differences

原题链接

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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”.

题目大意
给你一个序列，你可以让它重组，使其满足
思路
将该序列进行排序，将最大的放在结果序列中的最后一个，最小的放在倒数第二个，次大的放在结果序列的倒数第三个，次小的放在倒数第四个，以此类推，可得到所求数列。

代码

#include<bits/stdc++.h>

using namespace std;
const int N = 1e5+10;

int n,m,T;
int a[N],ans[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 + 1 + n);//排序
    	int f = 1,e = n;//设定两个指针，便于结果数列的存储
    	for(int i = n;i > 0;i --){
    		if(i % 2 == 0) ans[i] = a[e--];
    		else ans[i] = a[f++];
    	}
    	for(int i = 1;i <= n;i ++)	printf("%d ",ans[i]);
    	puts("");
    }
    return 0;
}