-
Notifications
You must be signed in to change notification settings - Fork 1
/
1339B - Sorted Adjacent Differences.cpp
45 lines (43 loc) · 1.18 KB
/
1339B - Sorted Adjacent Differences.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/** ========================================**
** @Author: Kareem Taha Abdelfatah
** @Category: Codeforces problems solutions
** @brief: Problem Solving solutions
/** ========================================**/
#include<bits/stdc++.h>
#include<iterator>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll "\n"
#define ll long long
#define LightOn(n, k) ((n) | (1<<k))
#define Lightoff(n, k) ((n) & (~(1<<k)))
#define IsOn(n, k) ((n>>k)&1)
const long long N = 2e5 + 5;
const double PI = 3.14;
const double Prox = 1e-7;
map<ll, ll>mp;
ll a[N];
set<ll>s;
int main()
{
IO
ll Tc; cin >> Tc;
while(Tc--){
vector<ll>(v);
ll n, neg = 0, pos = 0; cin >> n;
for(ll i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
ll l = 0, r = n - 1;
while(r > l){
v.push_back(a[r]);
v.push_back(a[l]);
r--;
l++;
}
if(n % 2 != 0) v.push_back(a[n / 2]);
reverse(v.begin(), v.end());
for(ll i = 0; i < n; i++) cout << v[i] << " ";
cout << endll;
}
return 0;
}