Assigning to Classes CodeForces

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

There are 2n2n students, the ii-th student has skill level aiai. 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 22 classes such that each class has odd number of students (not divisible by 22). 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 tt (1≤t≤1041≤t≤104). The description of the test cases follows.

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

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

It is guaranteed that the sum of nn over all test cases does not exceed 105105.

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|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][6,4,2], so that the skill level of the first class will be 44, and second with [5,1,3][5,1,3], so that the skill level of the second class will be 33. Absolute difference will be |4−3|=1|4−3|=1.

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

[2][2], [1,3,4][1,3,4] is also not possible because students with skills 55 and 66 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][3,4,13,13,20],[2,5,8,16,17] or [3,8,17],[2,4,5,13,13,16,20][3,8,17],[2,4,5,13,13,16,20]. Both divisions give minimal possible absolute difference.
排序后找中间的那两个数字就可以了。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;const int maxx=2e5+100;
int a[maxx];
int n;int main()
{int t;scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=1;i<=2*n;i++) cin>>a[i];sort(a+1,a+1+2*n);cout<<abs(a[n]-a[n+1])<<endl;}return 0;
}

努力加油a啊，(^o)/~

Assigning to Classes CodeForces - 1300B相关推荐

Codeforces Round #618 (Div. 2)-B. Assigning to Classes
Reminder: the median of the array [a1,a2,-,a2k+1] of odd number of elements is defined as follows: l ...
贪心 ---- Codeforces Round #618 (Div. 2)B. Assigning to Classes+贪心[证明过程]
题目链接题目大意:给你2∗n2*n2∗n个数,将这些数分成2个集合使得两个集合中位数的差值最小解题思路:我懵了一个结论就是排序之后取中间的两个数然后就ac了我们先对这些数字从小到大排序证明:1 ...
B. Assigning to Classes
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
CF 1300.B——Assigning to Classes【思维】
题目传送门 Reminder: the median of the array [a1,a2,-,a2k+1][a1,a2,-,a_{2k+1}][a1,a2,-,a2k+1] of odd num ...
jquery创建a_如何使用jQuery创建游戏
jquery创建a How to create a game using jQuery Today we are making a simple puzzle game called "Fi ...
Codeforces Round #404 (Div. 2) B. Anton and Classes 水题
B. Anton and Classes 题目连接: http://codeforces.com/contest/785/problem/B Description Anton likes to pl ...
codeforces div2 Not Assigning 题解
codeforces div2 Not Assigning 题解原题链接 /* 题意:构造一棵素数树.素数树定义如下: 这颗树中任意一条边 or 任意两条边权重之和为素数,每条边的权重自己分配. ...
Codeforces Round #766 (Div. 2)C. Not Assigning
C. Not Assigning 题意:给出n个节点,n-1条路经,给每条路径赋上初值(这里的值必须为素数),使得每两条路径权值之和为素数,且对于每条路径,每个节点只能访问一次(即判断是否为线性结构) ...
Educational Codeforces Round 10 A. Gabriel and Caterpillar 模拟
A. Gabriel and Caterpillar 题目连接: http://www.codeforces.com/contest/652/problem/A Description The 9-t ...

Assigning to Classes CodeForces - 1300B

Assigning to Classes CodeForces - 1300B相关推荐

最新文章

热门文章