题目

题目链接：https://codeforc.es/contest/1339/problem/B

思路

A B C D E
A B C|D E
C B A|D E
C D B A E

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[100010];
bool vis[100010];
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
		} 
		sort(a+1,a+1+n);
		if(n%2)	cout<<a[n/2+1]<<" ";
		for(int i=n/2;i>=1;i--){
			cout<<a[i]<<" "<<a[n-i+1]<<" \n"[i==1]; 
		}
	}
    return 0;
}