In this

**HackerEarth Team division problem solution**There are N (where N is always even) players standing in a line where the coordinates of players are given as $$(X1,0), (X2,0)... (XN,0)(P, 0)(P,0)$$, you are independent to choose their side.Find the number of such possible coordinates where teams can be divided.

## HackerEarth Team division problem solution.

`#include<bits/stdc++.h>`

using namespace std;

#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)

#define mod 1000000007

#define endl "\n"

#define test ll t; cin>>t; while(t--)

typedef long long int ll;

int main() {

FIO;

test

{

ll n; cin>>n;

vector<ll>a(n);

for(auto &it:a) cin>>it;

sort(a.begin(),a.end());

cout<<a[n/2]-a[(n/2)-1]+1<<endl;

}

return 0;

}

### Second solution

`t = int(input())`

while t > 0:

t -= 1

n = int(input())

x = list(map(int, input().split()))

x.sort()

print(x[n // 2] - x[n // 2 - 1] + 1)

## 0 Comments