-
Notifications
You must be signed in to change notification settings - Fork 62
/
Copy pathMXMEDIAN.cpp
50 lines (44 loc) · 1.12 KB
/
MXMEDIAN.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
46
47
48
49
50
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~© Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutosh001~~~~~~~~~~
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Result = Correct Answer (100 marks)
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define mod(x) x%1000000007;
#define MIN(n1, n2 ) ((n1) > (n2) ? (n2) : (n1))
#define MAX(n1, n2 ) ((n1) > (n2) ? (n1) : (n2))
#define MID(s, e) (s+(e-s)/2)
#define FOR(i, a, b) int i; for(i=(a);i<(b);i++)
#define FORD(i, a, b) int i; for(i=(a);i>(b);i--)
#define show(a) for(i=0;i<sizeof(a);i++) cout<<a[i]<<" ";
#define get(a) for(i=0;i<sizeof(a);i++) cin>>a[i];
#define scanint(a) scanf("%d",&a)
#define scanLLD(a) scanf("%lld",&a)
#define scanstr(s) scanf("%s",s)
#define scanline(l) scanf(" %[^\n]",l);
typedef long int BIG;
typedef long long PAPA;
int main()
{
std::ios_base::sync_with_stdio(false);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
int dn = 2*n;
int a[dn], i;
for (i = 0; i < dn; ++i) {
cin >> a[i];
}
sort(a, a+dn);
cout << a[n+n/2] << endl;
for (i = 0; i < n; i++) {
cout << a[i] << " " << a[n+i] <<" ";
}
cout << endl;
}
return 0;
}