input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
n = int(eval(input()))
p = sorted(list(map(int, input().split())))
mid = n // 2
ans = 0
for i in range(p[mid-1], p[mid]):
if len([j for j in p if j > i]) == mid:
ans += 1
print(ans)
|
n = int(eval(input()))
p = sorted(list(map(int, input().split())))
mid = n // 2
print((p[mid] - p[mid-1]))
|
p02989
|
N=int(eval(input()))
D=list(map(int,input().split()))
D.sort()
mi=D[0]
ma=D[N-1]
point=0
for j in range(mi,ma+1): #Kはj
i=0
while D[i]<j and i<N-1:
i+=1
if i==N//2 :
point+=1
print(point)
|
N=int(eval(input()))
D=list(map(int,input().split()))
D.sort()
mi=D[0]
ma=D[N-1]
point=0
for j in range(mi,ma+1): #Kはj
if D[N//2-1]<j<=D[N//2]:
point+=1
print(point)
|
p02989
|
n = int(eval(input()))
dif = [int(i) for i in input().split()]
max_dif = max(dif)
ans = 0
for i in range(max_dif+1):
ARC = []
ABC = []
for j in range(n):
if dif[j] >= i:
ARC.append(dif[j])
else:
ABC.append(dif[j])
if len(ARC) == len(ABC):
ans += 1
print(ans)
|
n = int(eval(input()))
dif = [int(i) for i in input().split()]
dif.sort()
print((dif[n//2] - dif[n//2 -1]))
|
p02989
|
import statistics
N = int(eval(input()))
d = input().split()
d = list(map(int,d))
L=0
R=0
DDT = 0
ans = 0
for K in range(statistics.median_low(d)-min(d),statistics.median_low(d)+max(d)):
for i in range(N):
if d[i] == K:
DDT += 1
elif d[i] < K:
L += 1
else:
R += 1
if L == R:
ans += 1
else:
while DDT > 0:
if L < R:
L += 1
DDT -= 1
elif L > R:
R += 1
DDT -= 1
else:
L += 1
DDT -= 1
if L == R:
ans += 1
L = 0
R = 0
DDT = 0
print((ans-1))
|
N = int(eval(input()))
d = input().split()
d = list(map(int,d))
d.sort()
ans = d[N//2] - d[(N//2)-1]
print(ans)
|
p02989
|
n,*l=list(map(int,open(0).read().split()));n//=2;l.sort();print((l[n]-l[~n]))
|
n,*d=list(map(int,open(0).read().split()))
l,r=sorted(d)[n//2-1:n//2+1]
print((r-l))
|
p02989
|
n,*l=list(map(int,open(0).read().split()))
n//=2
l.sort()
print((l[n]-l[~n]))
|
m=int(eval(input()))//2
l=sorted(map(int,input().split()))
print((l[m]-l[~m]))
|
p02989
|
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for k in range(1, max(p) + 1):
abc = 0
arc = 0
for i in p:
if i < k:
abc += 1
else:
arc += 1
if abc == arc:
ans += 1
print(ans)
|
n = int(eval(input()))
p = sorted(list(map(int, input().split())))
a = int(len(p) / 2)
if p[a-1] == p[a]:
print((0))
else:
print((p[a] - p[a-1]))
|
p02989
|
import math
def py():
print("Yes")
def pn():
print("No")
def iin():
x = int(eval(input()))
return x
neko = 0
nya = 0
nuko = 0
n = iin()
d = [int(x) for x in input().split()]
d.sort()
neko = int(n/2 - 1)
nuko = neko + 1
if d[neko] != d[nuko]:
for i in range(d[nuko]-d[neko]):
nya = nya + 1
print(nya)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d = sorted(d)
ans = d[n//2] - d[n//2-1]
print(ans)
|
p02989
|
#!/usr/bin/env python3
#ABC132 C
N = int(eval(input()))
d = list(map(int,input().split()))
ans = 0
for i in range(min(d),max(d)):
s = 0
t = 0
for j in range(N):
if d[j] <= i:
s += 1
else:
t += 1
if s > N//2:
break
if t > N//2:
break
if s == t:
ans += 1
print(ans)
|
#!/usr/bin/env python3
#ABC132 C
import sys
sys.setrecursionlimit(1000000)
from collections import deque
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
if N % 2 == 0:
print((d[N//2]-d[N//2-1]))
else:
print((0))
|
p02989
|
n = int(eval(input()))
q = list([int(x) for x in input().split()])
a = max(q)
b = min(q)
cnt = 0
for d in range(b,a+1):
ARC = 0
ABC = 0
for qq in q:
if qq >= d : ARC += 1
else: ABC += 1
if ARC == ABC:
cnt += 1
print(cnt)
|
n = int(eval(input()))
q = list([int(x) for x in input().split()])
q.sort()
cnt = q[int(n/2)] - q[int(n/2)-1]
print(cnt)
|
p02989
|
n=int(eval(input()))
li = list(map(int,input().split()))
li.sort()
ind=int(n//2)-1
count=0
for k in range(li[ind]+1,li[ind+1]+1):
miman=0
ijou=0
for num in li:
if num >= k:
ijou+=1
elif num < k:
miman+=1
if ijou==miman:
count+=1
print(count)
|
n=int(eval(input()))
li = list(map(int,input().split()))
li.sort()
ind=int(n//2)-1
count=0
for k in range(li[ind]+1,li[ind+1]+1):
count+=1
print(count)
|
p02989
|
n=int(eval(input()))
li = list(map(int,input().split()))
li.sort()
ind=int(n//2)-1
count=0
for k in range(li[ind]+1,li[ind+1]+1):
count+=1
print(count)
|
n=int(eval(input()))
#a,b=map(int,input().split())
dl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
ans=1
dl.sort()
if n%2==0:
mid=n//2
ans=dl[mid]-dl[mid-1]
print(ans)
|
p02989
|
N=int(eval(input()))
m=list(map(int,input().split()))
a=sorted(m)
count=0
for i in range(min(a),max(a)+1):
b=[j for j in a if i > j]
if len(b) == N/2:
count +=1
print(count)
|
N=int(eval(input()))
m=list(map(int,input().split()))
a=sorted(m)
ans=a[int(N/2)]-a[int(N/2)-1]
print(ans)
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
half = len(d) // 2
print((d[half] - d[half - 1]))
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
half = n // 2
print((d[half] - d[half - 1]))
|
p02989
|
def main():
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
half = n // 2
print((d[half] - d[half - 1]))
if __name__ == "__main__":
main()
|
import sys
def main():
n = int(sys.stdin.readline())
d = list(map(int, sys.stdin.readline().split()))
d.sort()
half = n // 2
print((d[half] - d[half - 1]))
if __name__ == "__main__":
main()
|
p02989
|
N = int(eval(input()))
D = [int(i) for i in input().split()]
cnt = 0
for i in range(max(D)+1):
ARC = 0
ABC = 0
for d in D:
if i <= d:
ARC +=1
else:
ABC +=1
if ARC == ABC:
cnt +=1
print(cnt)
|
N = int(eval(input()))
D = [int(i) for i in input().split()]
D_unique = list(set(D))
D.sort()
middle_idx = int(len(D)/2)
cnt = D[middle_idx]-D[middle_idx-1]
print(cnt)
|
p02989
|
n=int(eval(input()))
L=list(map(int,input().split()))
L.sort()
m=int(n/2)
cnt=0
for i in range(L[m-1]+1,L[m]+1):
if len(L[:m])==m:
cnt+=1
print(cnt)
|
n=int(eval(input()))
L=list(map(int,input().split()))
L.sort()
m=int(n/2)
if L[m-1]==L[m]:
print((0))
else:
print((L[m]-L[m-1]))
|
p02989
|
n=int(eval(input()))
d=list(map(int,input().split()))
cnt=0
for i in range(min(d),max(d)+1):
abc=0
arc=0
for j in range(len(d)):
if d[j] <= i:
abc+=1
else:
arc+=1
if abc == arc:
cnt+=1
print(cnt)
|
n=int(eval(input()))
d=list(map(int,input().split()))
A=sorted(d)
print((A[len(d)//2]-A[(len(d)//2)-1]))
|
p02989
|
n=int(eval(input()))
d=list(map(int,input().split()))
A=sorted(d)
print((A[len(d)//2]-A[(len(d)//2)-1]))
|
n=int(eval(input()))
d=list(map(int,input().split()))
d=sorted(d)
print((d[len(d)//2]-d[len(d)//2-1]))
|
p02989
|
N = int(eval(input()))
d = [int(x) for x in input().split()]
d.sort()
a = d[N // 2 - 1]
b = d[N // 2]
print((b - a))
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
left = d[N // 2 - 1]
right = d[N // 2]
print((right - left))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
left = d[N // 2 - 1]
right = d[N // 2]
print((right - left))
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
n = N // 2 -1
print((d[n+1] - d[n]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
n = N // 2 -1
print((d[n+1] - d[n]))
|
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
l,r = d[n//2-1], d[n//2]
print((r-l))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
if(len(d)%2 == 0):
d.sort()
t = int(len(d)/2)-1
s = d[t]
m = s
i = t
while (d[t+1] > s):
s += 1
print((s-m))
else:
print((0))
|
n = int(eval(input()))
d = list(map(int, input().split()))
if(len(d)%2 == 0):
d.sort()
t = int(len(d)/2)-1
print((d[t+1] - d[t]))
else:
print((0))
|
p02989
|
N=int(eval(input()))
d=list(map(int, input().split()))
d=sorted(d)
ans=0
for i in range(10**7):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
print(ans)
|
N=int(eval(input()))
d=list(map(int, input().split()))
d=sorted(d)
ans=0
for i in range(10**6):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
print(ans)
|
p02989
|
N=int(eval(input()))
d=list(map(int, input().split()))
d=sorted(d)
ans=0
for i in range(10**6):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
print(ans)
|
N=int(eval(input()))
d=list(map(int, input().split()))
d=sorted(d)
ans=0
for i in range(1+10**5):
if d[int(N/2-1)] < i and i <= d[int(N/2)]:
ans +=1
print(ans)
|
p02989
|
N=int(eval(input()))
suu=(N/2)-1
d=list(map(int,input().split()))
for n in range(round(suu)):
s=d.index(max(d))
d.pop(s)
dai=max(d)
s=d.index(max(d))
d.pop(s)
syo=max(d)
print((dai-syo))
|
N=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
dai=d[round((N/2)-1)]
syo=d[round(N/2)]
print((syo-dai))
|
p02989
|
N = int(eval(input()))
nums = list(map(int,input().split()))
nums.sort()
cnt = 0
for i in range(min(nums),max(nums)+1):
if len(list(j for j in nums if j >= i)) == N //2 :
cnt += 1
print(cnt)
|
N = int(eval(input()))
nums = list(map(int,input().split()))
nums.sort()
cnt = nums[N//2] - nums[N//2-1]
print(cnt)
|
p02989
|
import sys
n, *d = list(map(int, sys.stdin.read().split()))
def main():
d.sort()
h = n // 2
l = d[h-1]; r = d[h]
return r - (l + 1) + 1
if __name__ == '__main__':
ans = main()
print(ans)
|
import sys
n, *a = list(map(int, sys.stdin.read().split()))
a.sort()
def main():
m = n // 2
l, r = a[m-1], a[m]
print((r - l))
if __name__ == '__main__':
main()
|
p02989
|
# Check Examples
#python 3.7.
# Check Examples
#python 3.7.1
n=int(eval(input()))
p=input().split()
p=list(map(int,p))
cnt=0
det=len([])
p=sorted(p)
for i in range(n):
arc=p[i:]
abc=p[:i]
if det and len(arc)<=len(abc):
cnt=p[i]-p[i-1]
break
if arc>abc:det=True
print (cnt)
|
# Check Examples
#python 3.7.1
n=int(eval(input()))
p=input().split()
p=list(map(int,p))
cnt=0
p=sorted(p)
if p[n//2]!=p[(n//2)-1]:
cnt=p[n//2]-p[(n//2)-1]
print (cnt)
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
k = max(d)
i = 0
j = 0
ans = 0
b = 0
s = 0
while i <= k:
while j <= n-1:
if d[j] < i:
s += 1
if d[j] >= i:
b += 1
j += 1
if b == s:
ans += 1
b = 0
s = 0
j = 0
i += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
ans = 0
if n % 2 == 1:
print(ans)
else:
ans = d[(n // 2)] - d[(n // 2 - 1)]
print(ans)
|
p02989
|
import sys
n=int(eval(input()))
ls=list(map(int,input().split()))
ls.sort()
end_k=ls[len(ls)//2]
cnt=0
for i in range(end_k):
num=0
for j in range(n):
if ls[j]>i:
num+=1
if num==n//2:
cnt+=1
print(cnt)
|
n=int(eval(input()))
ls=list(map(int,input().split()))
ls.sort()
print((ls[n//2]-ls[n//2-1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
s, t = N//2-1, N//2
cnt = 0
for i in range(d[s],d[t]+1):
tmp = [x>=i for x in d]
if tmp.count(True)==tmp.count(False):
cnt += 1
print(cnt)
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
s, t = N//2-1, N//2
ans = d[t] - d[s]
print(ans)
|
p02989
|
n=int(eval(input()))
p=list(map(int, input().split()))
c=0
x = sorted(p)
a,b= x[int(n/2)-1], x[int(n/2)]
for k in range(a, b+1):
arc = []
abc = []
for i in p:
if k >= i:
arc.append(arc)
elif k <= i:
abc.append(abc)
if len(arc) == len(abc):
c+=1
print(c)
|
n=int(eval(input()))
p=sorted(list(map(int, input().split())))
print((p[int(n/2)]-p[int(n/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(max(d)):
a = sum(x > i for x in d)
if a == (n/2):
ans += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n//2]-d[(n//2)-1]))
|
p02989
|
from collections import Counter
N = int(eval(input()))
D = list(map(int, input().split()))
cnt = Counter(D)
lst = []
for key in sorted(cnt.keys()):
lst.append([key, cnt[key]])
ans = 0
tmp = 0
for i, kv in enumerate(lst):
key, value = kv
tmp += value
if tmp == N - tmp:
if i + 1 < len(lst):
ans = lst[i+1][0] - key
break
else:
break
print(ans)
|
n = int(eval(input()))
d = sorted(map(int, input().split()))
a = d[n//2-1]
b = d[n//2]
print((b-a))
# print(d)
|
p02989
|
n=int(eval(input()))
d=list(map(int,input().split()))
dd=sorted(d)
N=dd[n-1]
sum1=0
sum2=0
count=0
for k in range(N+1):
for i in range(n):
if d[i]>=k:
sum1+=1
if sum1==n-sum1:
count+=1
sum1=0
sum2=0
print(count)
|
n=int(eval(input()))
d=list(map(int,input().split()))
dd=sorted(d)
N=dd[int((n/2))]-dd[int((n/2)-1)]
print(N)
|
p02989
|
#!/usr/bin/ python3.8
N=int(eval(input()))
d=[int(x) for x in input().split()]
d=sorted(d)
if N%2==1:
print((0))
exit(0)
print((d[N//2] - d[N//2-1]))
|
#!/usr/bin/ python3.8
N=int(eval(input()))
d=[int(x) for x in input().split()]
d.sort()
if N%2==1:
print((0))
exit(0)
x,y=d[N//2-1:N//2+1]
print((y-x))
|
p02989
|
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
ans = 0
for i in range(D[N // 2 - 1], max(D)) :
cnt = len(list([x for x in D if x <= i]))
if(cnt == N // 2) :
ans += 1
elif(cnt > N // 2) :
break
else :
pass
print(ans)
|
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
ans = 0
for i in range(N // 2) :
cnt = len(list([x for x in D if x <= D[N // 2 - 1 + i]]))
if(cnt == N // 2) :
ans += D[N // 2] - D[N // 2 - 1]
elif(cnt > N // 2) :
break
else :
pass
print(ans)
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[N//2]-d[N//2-1]))
|
import sys
input = sys.stdin.readline
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[N//2]-d[N//2-1]))
|
p02989
|
N = int(eval(input()))
D = list(map(int, input().split()))
def quicksort(a):
if len(set(a)) < 2:
return a
left = []
center = a.pop(0)
right = []
for i in a:
if center > i:
left.append(i)
else:
right.append(i)
left = quicksort(left)
right = quicksort(right)
left.append(center)
left.extend(right)
return left
D = quicksort(D)
left = D[int((N/2)-1)]
right = D[int(N/2)]
ans = 0
if left < right:
ans = right - left
print(ans)
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
middle = (N // 2) -1
print((d[middle+1] - d[middle]))
|
p02989
|
N=int(eval(input()))
d=list(map(int, input().split()))
d.sort()
left=d[N//2 -1]
right=d[N//2]
cnt=0
for i in range(left+1, right+1): #left+1<= i <=right
cnt+=1
print(cnt)
|
N=int(eval(input()))
d=list(map(int, input().split()))
a=sorted(d)
l=a[N//2 -1]
r=a[N//2]
print((r-l))
|
p02989
|
n=int(eval(input()))
d=[int(x) for x in input().rstrip().split()]
d.sort()
if d[n//2-1]==d[n//2]:
print((0))
else:
print((d[n//2]-d[n//2-1]))
|
n=int(eval(input()))
d=[int(x) for x in input().rstrip().split()]
d.sort()
ind=n//2
if d[ind-1]==d[ind]:
print((0))
else:
print((d[ind]-d[ind-1]))
|
p02989
|
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
k = d[n // 2] - d[(n // 2) - 1]
print(k)
|
n = int(eval(input()))
d = sorted([int(i) for i in input().split()])
print((d[n//2] - d[n//2 - 1]))
|
p02989
|
n = int(eval(input()))
d = sorted([int(i) for i in input().split()])
print((d[n//2] - d[n//2 - 1]))
|
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
print((d[n//2] - d[n//2 - 1]))
|
p02989
|
n = int(eval(input()))
p = list(map(int, input().split(" ")))
a = 0
for r in range(min(p) - 1, max(p)+1):
abc = list([x for x in p if x < r])
arc = list([x for x in p if x >= r])
if len(abc) == len(arc) :
a += 1
print(a)
|
n = int(eval(input()))
p = list(map(int, input().split(" ")))
a = 0
p.sort()
n_2 = int(n / 2)
abc = p[:n_2]
arc = p[n_2:]
a = arc[0] - (abc[len(abc) - 1])
print(a)
|
p02989
|
n = int(eval(input()))
l = list(map(int, input().split()))
for i in range(int(n/2-1)):
l.remove(max(l))
l.remove(min(l))
r = abs(l[1]-l[0])
print(r)
|
n = int(eval(input()))
l = sorted(list(map(int, input().split())))
d = int(n / 2)
r = l[d] - l[d-1]
print(r)
|
p02989
|
from collections import Counter
n = int(eval(input()))
d = list(map(int, input().split()))
minD = min(d)
maxD = max(d)
c = Counter(d)
abc = 0
arc = n
ans = 0
for i in range(minD, maxD+1):
abc += c[i-1]
arc -= c[i-1]
if abc == arc:
ans += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((max(0, d[n//2] - d[n//2 - 1])))
|
p02989
|
N = int(eval(input()))
d = list(map(int,input().split()))
max_k = max(d)
min_k = min(d)
d.sort()
abc = []
arc = []
count = 0
for k in range(min_k,max_k + 1):
abc = [num for num in range(0,N) if d[num] < k]
arc = [num for num in range(0,N) if d[num] >= k]
if(len(abc) == len(arc)):
count += 1
print(count)
|
N = int(eval(input()))
d = list(map(int,input().split()))
max_k = max(d)
min_k = min(d)
d.sort()
half = N // 2
print((d[half] - d[half - 1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int,input().split()))
max_k = max(d)
min_k = min(d)
d.sort()
half = N // 2
print((d[half] - d[half - 1]))
|
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
half = N // 2
print((d[half] - d[half - 1]))
|
p02989
|
N = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for j in range(max(p)):
agc = [i for i in p if i>j]
if len(agc) == len(p)-len(agc):
ans += 1
print(ans)
|
N = int(eval(input()))
p = list(map(int,input().split()))
p = sorted(p)
c = p[N//2-1]
d = p[N//2]
print((d-c))
|
p02989
|
N=int(eval(input()))
d=list(map(int, input().strip().split()))
ans=0
d.sort()
for i in range(int(d[int(N/2)-1]),int(d[int(N/2)]+1)):
ABC=0
ARC=0
for j in range(int(N)):
if d[j]<i:
ABC+=1
else:
ARC+=1
if ARC==ABC:
ans+=1
print(ans)
|
N=int(eval(input()))
d=list(map(int, input().strip().split()))
ans=0
d.sort()
#for i in range(int(d[int(N/2)-1]),int(d[int(N/2)]+1)):
print((int(d[int(N/2)])-int(d[int(N/2)-1])))
|
p02989
|
#!/usr/bin/env python3
import sys
def solve(N: int, d: "List[int]"):
import bisect
d.sort()
if(N%2 == 1):
print((0))
else:
print((d[int(N/2)] - d[int(N/2)-1]))
return
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
d = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
solve(N, d)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, d: "List[int]"):
d.sort()
s = d[N//2-1]
e = d[N//2]
print((e-s))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
d = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, d)
if __name__ == '__main__':
main()
|
p02989
|
import sys
import collections as c
input = sys.stdin.readline
def main():
ans = 0
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
g = d[n//2]
items_count = c.Counter(d)
gc = items_count[g]
if gc == 1 or d[n//2-1] != g:
ans += g - d[n//2-1]
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
ans = 0
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
ans += d[n//2] - d[n//2-1]
print(ans)
if __name__ == '__main__':
main()
|
p02989
|
s = int(eval(input()))
list = [int(n) for n in input().split()]
print((sorted(list)[s//2] - sorted(list)[s//2 - 1]))
|
s = int(eval(input()))
list = [int(n) for n in input().split()]
s_l = sorted(list)
print((s_l[s//2] - s_l[s//2 - 1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int,input().split()))
count = 0
for K in range(min(d),max(d)+1):
ARC = [i for i in d if i >= K]
ABC = [j for j in d if j < K]
if len(ARC) == len(ABC):
count += 1
print(count)
|
N = int(eval(input()))
d = list(map(int,input().split()))
d_sorted = sorted(d, reverse = False)
count = d_sorted[(N-1) //2 + 1] - d_sorted[(N-1) // 2]
print(count)
|
p02989
|
N = int(eval(input()))
d_list = list(map(int, input().split()))
d_list.sort()
from bisect import bisect_right
ans = 0
for i in range(1, max(d_list)):
idx = bisect_right(d_list, i)
if N //2 == idx:
ans += 1
print(ans)
|
N = int(eval(input()))
d_list = list(map(int, input().split()))
d_list.sort()
print((d_list[N//2] - d_list[N//2 - 1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
min = min(d)
max = max(d)
count = 0
for k in range(min,max+1) :
abc = 0 ; arc = 0
for idx in range(n) :
if d[idx] >= k :
arc += 1
else :
abc += 1
if abc == arc :
count += 1
print(count)
|
n = int(eval(input()))
d = sorted(map(int, input().split()))
med_idx = int(n/2)
print((d[med_idx]-d[med_idx-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d_max = max(d)
d_half = len(d) // 2
ans = 0
for i in range(1, d_max+1):
abc = [x for x in d if x < i]
if len(abc) == d_half:
ans += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n//2] - d[n//2-1]))
|
p02989
|
N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(list(set(X)))
Z = [X.count(y) for y in Y]
cnt = 0
for i in range(len(Y)):
cnt += Z[i]
if cnt == N//2:
cnt = Y[i+1] - Y[i]
break
elif cnt > N//2:
cnt = 0
break
print(cnt)
|
N = int(eval(input()))
X = sorted(list(map(int,input().split())))
print((X[N//2]-X[N//2-1]))
|
p02989
|
n = int(eval(input()))
l = list(map(int, input().split()))
k = max(l)
ans = 0
for i in range(k + 1):
ar = 0
ab = 0
for j in l:
if j >= i:
ar += 1
else:
ab += 1
if ar == ab:
ans += 1
print(ans)
|
n = int(eval(input()))
l = list(map(int, input().split()))
k = max(l)
a = sorted(l)
print((a[n // 2] - a[n // 2 - 1]))
|
p02989
|
n = int(eval(input()))
arr_input = list(map(int,input().split()))
arr = sorted(arr_input)
i = int(n/2)
ans = arr[i] - arr[i-1]
if ans == 0:
print((0))
else:
print(ans)
|
n = int(eval(input()))
arr_in = list(map(int,input().split()))
arr = sorted(arr_in)
n = int(n/2)
res = arr[n] - arr[n-1]
print(res)
|
p02989
|
n=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
l=n//2-1
half=(d[l]+d[l+1])//2
count=0
sum=0
if d[l]==d[l+1]:
print((0))
exit()
if d[l+1]>half:
sum+=d[l+1]-half
if d[l]!=half:
sum+=half-d[l]
print(sum)
|
n=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
l=n//2-1
half=(d[l]+d[l+1])//2
count=0
sum=0
if d[l]==d[l+1]:
print((0))
exit()
sum+=d[l+1]-d[l]
print(sum)
|
p02989
|
# C
N = int(eval(input()))
D = sorted(list(map(int, input().split())))
center = len(D)//2
cnt = 0
for k in range(min(D), max(D)+1):
for i in range(len(D)):
if D[i] >= k:
break
if center == i:
cnt += 1
print(cnt)
|
# C
import math
N = int(eval(input()))
D = sorted(list(map(int, input().split())))
print((D[math.ceil((N)/2)] - D[math.ceil((N)/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
k_count = 0
for i in range(len(d)):
arc = len(list([x for x in d if x > d[i]]))
abc = len(list([x for x in d if x <= d[i]]))
if arc == abc:
k_count += (d[i+1] - d[i])
print(k_count)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
k_count = 0
i = n // 2 - 1
arc = len(list([x for x in d if x > d[i]]))
abc = len(list([x for x in d if x <= d[i]]))
if arc == abc:
k_count += (d[i+1] - d[i])
print(k_count)
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(max(d)):
low = len([x for x in d if x > i])
if low == n - low:
ans += 1
print(ans)
|
n = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
d.sort()
low = d[:len(d)//2][-1]
high = d[len(d)//2:][0]
print((high - low))
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
way = 0
for k in range(1,max(d)+1):
arc = 0
abc = 0
for di in d:
if di >= k:
arc += 1
else:
abc += 1
if arc == abc:
way += 1
print(way)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[int(n/2)] - d[int(n/2)-1]))
|
p02989
|
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
d = list(map(int, input().split()))
mind = min(d)
maxd = max(d)
ans = 0
for i in range(mind, maxd):
n = sum(x > i for x in d)
if n == N // 2:
ans += 1
print(ans)
main()
|
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
d = list(map(int, input().split()))
sod = sorted(d)
print((sod[int(N/2)] - sod[int(N/2)-1]))
main()
|
p02989
|
N=int(eval(input()))
d=[int(x) for x in input().split()]
d.sort()
M=max(d)
A=[]
for i in range(M+1):
A.append(len([j for j in range(N) if d[j]==i]))
count=0
c=0
while(count<N/2):
count=count+A[c]
c=c+1
if count!=N/2:
print((0))
elif count==N/2:
d=0
while(count==N/2):
count=count+A[c]
c=c+1
d=d+1
print(d)
|
N=int(eval(input()))
d=[int(x) for x in input().split()]
d.sort()
print((d[int(N/2)]-d[int(N/2)-1]))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
cs = [0]
ans = 0
for i in range(d[-1]):
cs.append(cs[i]+d.count(i))
ans = cs.count(n/2)
print(ans)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
cs = [0]
ans = 0
l= 0
for i in range(d[-1]):
temp = 0
while(True):
if i == d[l]:
temp += 1
l += 1
else:
break
cs.append(cs[i]+temp)
ans = cs.count(n/2)
print(ans)
|
p02989
|
n = int(eval(input()))
list_d = sorted(list(map(int, input().split())))
d_max = max(list_d)
d_min = min(list_d)
score = 0
for i in range(d_min, d_max+2):
#abcを数える
score1 = 0
score2 = 0
for j in list_d:
if j < i:
score1 += 1
if j >= i:
score2 += 1
if score1 == score2:
score += 1
print(score)
|
n = int(eval(input()))
list_d = sorted(list(map(int, input().split())))
list_b = list_d[:int(n/2)]
list_r = list_d[int(n/2):]
print((len(list(range(list_b[-1] + 1, list_r[0] + 1)))))
|
p02989
|
a = int(eval(input()))
b = [int(i) for i in input().split()]
b.sort()
if b[a // 2 - 1] == b[a // 2]:
print((0))
else:
print((b[a // 2] - b[a // 2 - 1]))
|
a = int(eval(input()))
b = list(map(int, input().split()))
b.sort()
for i in range(a//2, a):
print((b[i]-b[i-1]))
exit()
|
p02989
|
from bisect import bisect_left
n=int(eval(input()))
d=list(map(int,input().split()))
d=sorted(d)
ans=0
for i in range(1,10**5+1):
p=bisect_left(d,i)
ans+=1 if p==(n-p) else 0
print(ans)
|
n=int(eval(input()))
d=sorted(list(map(int,input().split())))
ans=d[n//2]-d[n//2-1]
print(ans)
|
p02989
|
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
banken = 1
for item in d:
if len(d[:banken]) == len(d[banken:]):
break
if banken >= len(d):
break
banken += 1
print((d[banken] - d[banken-1]))
|
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
banken = len(d) // 2
print((d[banken] - d[banken-1]))
|
p02989
|
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations, combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop
INF = float('inf')
NIL = - 1
""" Input
S = input().rstrip()
N, A, B = map(int, input().split())
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""
N = int(eval(input()))
D = list(map(int, input().split()))
D = sorted(D)
counter = 0
for i in range(D[N // 2], D[N // 2 - 1], -1):
counter += 1
print(counter)
# def main():
# if __name__ == '__main__':
# main()
|
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations, combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop
INF = float('inf')
NIL = - 1
N = int(eval(input()))
D = list(map(int, input().split()))
D = sorted(D)
#
# counter = 0
# for i in range(D[N // 2], D[N // 2 - 1], -1):
# counter += 1
print((D[N // 2] - D[N // 2 - 1]))
|
p02989
|
#!/usr/bin/env python3
import sys
def solve(N: int, d: "List[int]"):
b = [0] * (10**5 +1)
for i in range(N):
b[d[i]] += 1
t = 0
f = False
ans = 0
for i in range(1, 10 ** 5 + 1):
if not f:
t += b[i]
if t == N / 2:
f = True
elif t > N / 2:
ans = 0
break
else:
ans += 1
if b[i] != 0:
break
print(ans)
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
d = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, d)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys
def solve(N: int, d: "List[int]"):
d.sort()
abc = d[int(N/2)-1]
arc = d[int(N/2)]
print((arc-abc))
return
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
d = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, d)
if __name__ == '__main__':
main()
|
p02989
|
from bisect import bisect_left
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
to_take = N // 2
cnt = 0
for x in range(d[0], d[-1] + 1):
idx = bisect_left(d, x)
# ABC用の問題数
if idx == to_take:
cnt += 1
print(cnt)
|
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n // 2] - d[n // 2 - 1]))
|
p02989
|
import sys
sys.setrecursionlimit(10 ** 9)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
from collections import deque
def solve():
n = II()
D = deque(sorted(LI()))
for i in range(n):
l = D.popleft()
# print('l', l)
if len(D) == 0:
print((1))
break
else:
r = D.pop()
# print('r', r)
if len(D) == 0:
print((r - l))
break
else:
continue
if __name__ == '__main__':
solve()
|
# import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solve():
n = II()
D = LI()
D = sorted(D)
t = n // 2
print((D[t] - D[t-1]))
if __name__ == '__main__':
solve()
|
p02989
|
n=int(eval(input()))
# print(n)
di=[]
for i in map(int,input().split()):
di.append(i)
di.sort()
n1=int(n/2)
m=di[n1] -di[n1-1]
print(m)
|
n=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
print((d[n//2]-d[n//2-1]))
|
p02989
|
n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(a)
print((a[n//2]-a[(n//2)-1]))
|
n=int(eval(input()))
a=list(map(int,input().split()))
a=sorted(a)
l=n//2-1
r=n//2
print((a[r]-a[l]))
|
p02989
|
# coding: utf-8
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
idx = len(d) // 2
l = d[idx-1]
r = d[idx]
print((r - l))
|
# coding: utf-8
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
idx = N // 2
print((d[idx] - d[idx-1]))
|
p02989
|
n = int(eval(input()))
A = sorted(list(map(int, input().split())))
leng = len(A)//2
print((A[leng] - A[leng-1]))
|
N = int(eval(input()))
A = sorted(map(int, input().split()))
ans = A[N//2] - A[N//2-1]
print(ans)
|
p02989
|
input_line=int(eval(input()))
ARC = [int(i)for i in input().split()]
count=0
for i in range(10**5):
AARC = ARC
for s in ARC:
if s<i:
while s in AARC:
AARC.remove(s)
if (input_line//2)== len(AARC):
count+=1
print(count)
|
input_line=int(eval(input()))
ARC = [int(i)for i in input().split()]
ARC.sort()
middle = input_line //2
s = ARC[middle]-ARC[middle-1]
print(s)
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
k_max = max(d)
k_min = min(d)
result = 0
for k in range(k_min,k_max+1):
count = 0
for i in range(n):
if d[i] >= k:
count += 1
if count > n//2:
break
if count == n//2:
result += 1
print(result)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
l = d[n//2 -1]
r = d[n//2]
print((r - l))
|
p02989
|
n = int(eval(input()))
d = list(int(x) for x in input().split())
ans = 0
for k in range(1, max(d) + 1):
arc_num = 0
abc_num = 0
for i in range(n):
if d[i] >= k:
arc_num += 1
else:
abc_num += 1
if arc_num == abc_num:
ans += 1
print(ans)
|
import bisect
n = int(eval(input()))
d = list(int(x) for x in input().split())
d.sort()
print((d[(n // 2)] - d[(n // 2) - 1]))
"""
for k in range(d[n // 2], d[(n // 2) + 1]):
if bisect.bisect_left(d, k) == n // 2:
ans += 1
"""
|
p02989
|
import sys
import math
N = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(min(d),max(d) + 1):
ARC = 0
ABC = 0
for j in range(N):
if d[j] < i:
ARC = ARC + 1
else:
ABC = ABC + 1
if ABC == ARC:
ans = ans + 1
print(ans)
|
N = int(eval(input()))
d = sorted(list(map(int, input().split())))
print((d[N // 2] - d[N // 2 - 1]))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
harf_N = int(N/2)
print((d[harf_N] - d[harf_N - 1]))
|
n = int(eval(input()))
a = list(map(int, input().split()))
#print(n)
a.sort()
#print(a)
print((a[int(n/2)]-a[int(n/2)-1]))
|
p02989
|
n = int(eval(input()))
d = [int(i) for i in input().split()]
ans = 0
d.sort()
for k in range(n):
abc = d[0:k]
arc = d[k:n]
if len(abc) == len(arc):
ans = d[k] - d[k-1]
print(ans)
|
n = int(eval(input()))
d = [int(i) for i in input().split()]
ans = 0
d.sort()
abc = d[0:n//2]
arc = d[n//2:n]
if len(abc) == len(arc):
ans = d[n//2] - d[n//2-1]
print(ans)
|
p02989
|
N = int(eval(input()))
ds = input().split()
ds = [int(i) for i in ds]
ds.sort()
#print(ds)
#if ds[int(N/2)] == ds[int(N/2)+1]:
# print("0")
#else:
print((ds[int(N/2)]-ds[int(N/2)-1]))
|
N = int(eval(input()))
ds = input().split()
ds = [int(i) for i in ds]
ds.sort()
print((ds[int(N/2)]-ds[int(N/2)-1]))
|
p02989
|
N = int(eval(input()))
d = [int(i) for i in input().split()]
K = max(d)
ans = 0
for i in range(K+1):
temp_abc = 0
temp_arc = 0
for j in range(N):
if d[j] >= i:
temp_abc += 1
else:
temp_arc += 1
if temp_abc == temp_arc:
ans += 1
print(ans)
|
N = int(eval(input()))
d = [int(i) for i in input().split()]
D = sorted(d)
ans = D[int(N/2)] - D[int((N/2) - 1)]
print(ans)
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
d = sorted(d)
length = len(d) // 2
count = 0
for k in range(d[length - 1], d[length] + 1):
min = sum(x<k for x in d)
max = sum(x>=k for x in d)
if min == max:
count += 1
print(count)
|
n = int(eval(input()))
d = list(map(int,input().split()))
d = sorted(d)
length = len(d) // 2
max = d[length]
min = d[length - 1]
print((max - min))
|
p02989
|
n = int(eval(input()))
lst = [int(i) for i in input().split()]
lst = sorted(lst)
cnt = 0
d = int(n/2-1)
l = lst[d]
u = lst[d+1]
if l==u:
cnt = 0
else:
cnt = u-l
print(cnt)
|
n = int(eval(input()))
lst = sorted(list(map(int,input().split())))
l,r = lst[n//2-1],lst[n//2]
if l == r:
print((0))
else:
print((r-l))
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
m = d[N // 2 - 1]
l = d[N // 2]
print((l-m))
|
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
print((A[N//2]-A[N//2-1]))
|
p02989
|
# -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
"""
1 4 4 | 6 7 9 OK
1 4 4 | 4 7 9 だめ
1 2 3 | 3 7 9 だめ
"""
if D[int(N//2)-1] == D[int(N//2)]:
print((0))
return
ans = D[int(N//2)] - D[int(N//2)-1]
print(ans)
if __name__ == "__main__":
solve()
|
# -*- coding:utf-8 -*-
def solve():
N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
i = N//2
if D[i] != D[i-1]:
# 同じ数になるように分けることが可能
print((D[i]-D[i-1]))
return
print((0))
if __name__ == "__main__":
solve()
|
p02989
|
N = int(eval(input()))
D = list(map(int, input().split()))
dic = {}
ABCs = 0
count = 0
for i in range(N):
if D[i] in dic:
dic[D[i]] += 1
else:
dic[D[i]] = 1
diffs = sorted(dic.keys())
for i in range(diffs[-1]+1):
if i in dic:
ABCs += dic[i]
if ABCs == N / 2:
count += 1
print(count)
|
N = int(eval(input()))
D = list(map(int, input().split()))
dic = {}
ABCs = 0
count = 0
flag = 0
for i in range(N):
if D[i] in dic:
dic[D[i]] += 1
else:
dic[D[i]] = 1
diffs = sorted(dic.keys())
for k in range(diffs[-1]+1):
if flag == 0:
if ABCs == N / 2:
count += 1
flag += 1
else:
if ABCs > N / 2:
break
count += 1
if k in dic:
ABCs += dic[k]
print(count)
|
p02989
|
n=int(eval(input()))
d_s=input().split()
d=[int(x) for x in d_s]
judge=0
count=0
for i in range(1,100000):
for x in d:
if x==i:
count+=1
if count==n/2:
judge+=1
elif count>n/2:
break
print(judge)
|
n=int(eval(input()))
d_s=input().split()
d_i=[int(x) for x in d_s]
d=sorted(d_i)
k=d[int(n/2)]
t=d[int(n/2)-1]
print((k-t))
|
p02989
|
import sys
N = int(eval(input()))
D = sorted(list(map(int,input().split())))
if N % 2 != 0:
print((0))
sys.exit()
low = D[0:N//2]
high = D[N//2::]
cnt = 0
flg = True
for i in range(low[-1], min(high) + 1):
flg = True
for L in low:
if i <= L:
flg = False
for L in high:
if i > L:
flg = False
if flg == True:
cnt = cnt + 1
print(cnt)
|
import sys
N = int(eval(input()))
D = sorted(list(map(int,input().split())))
if N % 2 != 0:
print((0))
sys.exit()
low = D[0:N//2]
high = D[N//2::]
flg = all( low[-1] + 1 > x for x in low )
flg |= all( high[0] - 1 >= x for x in high )
if flg == True:
print((high[0] - low[-1]))
else:
print((0))
|
p02989
|
N=int(eval(input()))
D=list(map(int,input().split()))
cnt=0
for i in range(min(D),max(D)+1):
c=[]
for d in D:
if d>=i:
c.append(d)
if len(c)==N//2:
cnt+=1
print(cnt)
|
n=int(eval(input()))
D=list(map(int,input().split()))
D=sorted(D,reverse=True)
print((D[n//2-1]-D[n//2]))
|
p02989
|
n = int(eval(input()))
d = list(map(int,input().split()))
arc = []
abc = []
cnt = 0
if n % 2 == 1:
print((0))
exit()
d.sort()
right = n // 2
left = right - 1
for i in range(d[left],d[right]+1):
k = i
abc = []
arc = []
for j in d:
if j >= k:
arc.append(j)
elif j < k:
abc.append(j)
if len(arc) == len(abc):
cnt += 1
print(cnt)
|
n = int(eval(input()))
d = list(map(int,input().split()))
arc = []
abc = []
cnt = 0
d.sort()
pivot = n//2
k = d[pivot]
for i in range(n):
if d[i] >= k:
arc.append(d[i])
elif d[i] < k:
abc.append(d[i])
if len(arc) == len(abc):
cnt = d[pivot] - d[pivot-1]
print(cnt)
|
p02989
|
N = int(eval(input()))
d = list(map(int, input().split()))
count = 0
d.sort()
for i in range((N-2)//2):
d = d[1:]
d = d[:-1]
print((d[1]-d[0]))
|
N = int(eval(input()))
d = list(map(int, input().split()))
count = 0
d.sort()
print((d[N//2]-d[N//2-1]))
|
p02989
|
N = int(eval(input()))
D = [int(i) for i in input().split()]
cnt = 0
for i in range(1,max(D)+1):
arc = []
abc = []
for j in range(len(D)):
if D[j] > i:
arc.append(D[j])
else:
abc.append(D[j])
#print(abc, arc)
if len(arc) == len(abc):
cnt += 1
print(cnt)
|
N = int(eval(input()))
D = [int(i) for i in input().split()]
D.sort()
print((D[N//2] - D[N//2-1]))
|
p02989
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.