I - Assigning to Classes CodeForces - 1300B

I - Assigning to Classes

Reminder: the median of the array [a1,a2,…,a2k+1] of odd number of elements is defined as follows: let [b1,b2,…,b2k+1] be the elements of the array in the sorted order. Then median of this array is equal to bk+1.

There are 2n students, the i-th student has skill level ai. It’s not guaranteed that all skill levels are distinct.

Let’s define skill level of a class as the median of skill levels of students of the class.

As a principal of the school, you would like to assign each student to one of the 2 classes such that each class has odd number of students (not divisible by 2). The number of students in the classes may be equal or different, by your choice. Every student has to be assigned to exactly one class. Among such partitions, you want to choose one in which the absolute difference between skill levels of the classes is minimized.

What is the minimum possible absolute difference you can achieve?

Input
Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤104). The description of the test cases follows.

The first line of each test case contains a single integer n (1≤n≤105) — the number of students halved.

The second line of each test case contains 2n integers a1,a2,…,a2n (1≤ai≤109) — skill levels of students.

It is guaranteed that the sum of n over all test cases does not exceed 105.

Output
For each test case, output a single integer, the minimum possible absolute difference between skill levels of two classes of odd sizes.

Example
Input
3
1
1 1
3
6 5 4 1 2 3
5
13 4 20 13 2 5 8 3 17 16
Output
0
1
5
Note
In the first test, there is only one way to partition students — one in each class. The absolute difference of the skill levels will be |1−1|=0.

In the second test, one of the possible partitions is to make the first class of students with skill levels [6,4,2], so that the skill level of the first class will be 4, and second with [5,1,3], so that the skill level of the second class will be 3. Absolute difference will be |4−3|=1.

Note that you can’t assign like [2,3], [6,5,4,1] or [], [6,5,4,1,2,3] because classes have even number of students.

[2], [1,3,4] is also not possible because students with skills 5 and 6 aren’t assigned to a class.

In the third test you can assign the students in the following way: [3,4,13,13,20],[2,5,8,16,17] or [3,8,17],[2,4,5,13,13,16,20]. Both divisions give minimal possible absolute difference.

题意：多组输入，每组给你一个n，接下来是2n个数，你需要将这2n个数分成两个数组，然后使两个数组的中位数的差值最小。输出那个最小差值。

解题思路：现将这2n个数从大到小排序，选出其中差值最小的俩中间值，如果你要保证这俩数都是两个数组的中间值，你就只能选取第n和第n+1个数。所以我们不用其他多余步骤，直接将排完序过后的数列中的第n和第n+1项的差值输出即可。

代码：

#include<bits/stdc++.h>
#define ull unsigned long long
#define pi acos(-1)
using namespace std;
typedef long long ll;
const int maxn = 1e7+5;
int a[1000000];
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;cin>>n;
		for(int i=1;i<=2*n;i++) cin>>a[i];
		sort(a+1,a+2*n+1);
		cout<<a[n+1]-a[n]<<'\n';
	}
	return 0;
}