input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
S = X[0]+X[1]
T = 0
for i in range(2, N):
T ^= X[i]
if S<T or (S-T)%2:
print((-1))
sys.exit()
D = (S-T)//2
if D&T:
print((-1))
sys.exit()
Y = D
for i in range(T.bit_length()+1, -1, -1):
if T&(1<<i)|Y <= X[0]:
Y |= T&(1<<i)
if 0<Y<=X[0]:
print((X[0]-Y))
else:
print((-1))
| import sys
N, = list(map(int, input().split()))
X = list(map(int, input().split()))
S = X[0]+X[1]
T = 0
for i in range(2, N):
T ^= X[i]
D = (S-T)//2
if S<T or (S-T)%2 or T&D:
print((-1))
sys.exit()
for i in range(T.bit_length()+1, -1, -1):
if T&(1<<i)|D <= X[0]:
D |= T&(1<<i)
if 0<D<=X[0]:
print((X[0]-D))
else:
print((-1))
| p02626 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
a = X[:i] + X[i+1:]
med = sorted(a)[(N//2)-1]
print(med) | N = int(eval(input()))
X = list(map(int, input().split()))
SORTED = sorted(X)
med1 = SORTED[N//2 - 1]
med2 = SORTED[N//2]
# print(med1, med2)
for xi in X:
if xi <= med1:
print(med2)
else:
print(med1) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
d = dict(list(zip(list(range(0,n)), x)))
x.sort()
for i in range(0, n):
if d[i] in x[0:n//2] :
print((x[n//2]))
else :
print((x[n//2-1])) | n = int(eval(input()))
x = list(map(int, input().split()))
d = dict(list(zip(list(range(0,n)), x)))
x.sort()
for i in range(0, n):
if d[i] <= x[n//2-1] :
print((x[n//2]))
else :
print((x[n//2-1])) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
Y = X.copy()
Y.sort()
for i in X:
if Y.index(i) >= N//2:
print((Y[N//2-1]))
if Y.index(i) <= N//2 - 1:
print((Y[N//2])) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = X.copy()
Y.sort()
l = Y[N//2-1]
r= Y[N//2]
for i in X:
if i <= l:
print(r)
else:
print(l) | p03379 |
import copy
N=int(eval(input()))
X=list(map(int,input().split()))
Y=copy.deepcopy(X)
Z=N//2
for i in range(N):
Y.pop(i)
Y.sort()
print((Y[Z-1]))
Y=copy.deepcopy(X)
| import copy
N=int(eval(input()))
X=list(map(int,input().split()))
Y=copy.deepcopy(X)
Y.sort()
kiteichiA=Y[N//2-1]
kiteichiB=Y[N//2]
for i in range(N):
if X[i]>=kiteichiB:
print(kiteichiA)
elif X[i]<=kiteichiA:
print(kiteichiB)
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
d=sorted(x)
b1=d[len(x)//2-1]
b2=d[len(x)//2]
for i in x:
if i<=b1:
print(b2)
elif i>=b2:
print(b1)
| n=int(eval(input()))
x=list(map(int,input().split()))
ans=sorted(x)
ans2=ans[n//2-1]
ans1=ans[n//2]
for i in range(n):
if x[i]>=ans[n//2]:
print(ans2)
else:
print(ans1)
| p03379 |
import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
xx = x[:i] + x[i+1:]
print((statistics.median(xx)))
| import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
median_left = statistics.median_low(x)
median_right = statistics.median_high(x)
for i in range(n):
if x[i] == median_right:
print(median_left)
elif x[i] == median_left:
print(median_right)
else:
if x[i] < median_left:
print(median_right)
else:
print(median_left)
| p03379 |
import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
median_left = statistics.median_low(x)
median_right = statistics.median_high(x)
for i in range(n):
if x[i] == median_right:
print(median_left)
elif x[i] == median_left:
print(median_right)
else:
if x[i] < median_left:
print(median_right)
else:
print(median_left)
| import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
median_left = statistics.median_low(x)
median_right = statistics.median_high(x)
for i in range(n):
if x[i] >= median_right:
print(median_left)
else:
print(median_right)
| p03379 |
import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
median_left = statistics.median_low(x)
median_right = statistics.median_high(x)
for i in range(n):
if x[i] >= median_right:
print(median_left)
else:
print(median_right)
| #!/usr/bin/env python3
import sys
def solve(N: int, X: "List[int]"):
Y = sorted(X)
me1 = Y[N//2]
me2 = Y[N//2-1]
for i in range(N):
if X[i]<=me2:
print(me1)
elif X[i]>=me1:
print(me2)
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
X = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, X)
if __name__ == '__main__':
main()
| p03379 |
n = int(eval(input()))
x_l = list(map(int,input().split()))
s_x_l = [ (i, j) for i,j in enumerate(x_l) ]
s_x_l = sorted(s_x_l, key=lambda x: x[1])
size = len(s_x_l)
med_idx = int((size-1+1)/2)-1
ans = []
for i in range(n):
left = s_x_l[:i]
right = s_x_l[i+1:]
idx = s_x_l[i][0]
merge = left+right
med = merge[med_idx][1]
ans.append([idx, med])
ans = sorted(ans, key=lambda x:x[0])
for i in ans:
print((i[1])) | n = int(eval(input()))
x_l = list(map(int,input().split()))
s_x_l = sorted(x_l)
med_idx = n//2
med_l = s_x_l[med_idx-1]
med_r = s_x_l[med_idx]
for i in range(n):
if x_l[i] <= med_l:
print(med_r)
else:
print(med_l) | p03379 |
n = int(eval(input()))
x = input().split()
for i in range(n):
x[i] = int(x[i])
for i in range(n):
xm = x[:i] + x[i+1:]
xm = sorted(xm)
print((xm[int(n/2)-1])) | n = int(eval(input()))
x = input().split()
for i in range(n):
x[i] = int(x[i])
xs = sorted(x)
ml = xs[n//2-1]
mr = xs[n//2]
for i in range(n):
if x[i] <= ml:
print(mr)
elif x[i] >= mr:
print(ml) | p03379 |
import bisect
N = int(input())
X = [int(i) for i in input().split()]
ans = []
for i in range(N):
num = X.pop(i)
a = X[:]
a.sort()
ans.append(a[(N-1)//2])
X.insert(i, num)
print(*ans, sep='\n')
| N = int(eval(input()))
X = [int(i) for i in input().split()]
a = X[:]
a.sort()
l = a[N//2-1]
r = a[N//2]
if l == r:
for i in range(N):
print(l)
else:
for i in range(N):
if X[i] <= l:
print(r)
elif X[i] >= r:
print(l) | p03379 |
n=int(eval(input()))
p=n//2
l=list(map(int,input().split()))
for i in range(n):
m=l[:i]+l[i+1:]
m.sort()
print((m[p-1])) | n=int(eval(input()))
x=list(map(int,input().split()))
l=sorted(x)
m1=l[n//2-1]
m2=l[n//2]
for i in range(n):
if x[i]<=m1:
print(m2)
else:
print(m1)
| p03379 |
n = int(eval(input()))
ary = list(map(int,input().split()))
a = sorted(ary)
c = (len(ary)+1)//2-1
for i in range(n):
b = a.copy()
b.remove(ary[i])
print((b[c])) | n = int(eval(input()))
ary = list(map(int,input().split()))
a = sorted(ary)
b = (len(ary)+1)//2-1
for i in range(n):
if a[b] < ary[i]:
print((a[b]))
elif a[b] == ary[i]:
print((a[b+1]))
elif a[b] > ary[i]:
print((a[b+1])) | p03379 |
n = int(eval(input()))
ary = list(map(int,input().split()))
a = sorted(ary)
b = (len(ary)+1)//2-1
for i in range(n):
if a[b] < ary[i]:
print((a[b]))
elif a[b] == ary[i]:
print((a[b+1]))
elif a[b] > ary[i]:
print((a[b+1])) | n = int(eval(input()))
ary = list(map(int,input().split()))
a = sorted(ary)
b = (len(ary)+1)//2-1
for i in range(n):
if a[b] < ary[i]:
print((a[b]))
elif a[b] >= ary[i]:
print((a[b+1])) | p03379 |
n = int(eval(input()))
ary = list(map(int,input().split()))
a = sorted(ary)
b = (len(ary)+1)//2-1
for i in range(n):
if a[b] < ary[i]:
print((a[b]))
elif a[b] >= ary[i]:
print((a[b+1])) | n = int(eval(input()))
ary = list(map(int,input().split()))
ary_sort = sorted(ary)
a = len(ary)//2-1
for i in range(n):
if ary_sort[a] < ary[i]:
print((ary_sort[a]))
elif ary_sort[a] >= ary[i]:
print((ary_sort[a+1])) | p03379 |
import copy
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
med = copy.deepcopy(X)
med.pop(i)
med.sort()
print((med[int(N/2)-1])) | N = int(eval(input()))
X = list(map(int, input().split()))
Xsort = sorted(X)
med = (Xsort[N // 2] + Xsort[N // 2 - 1]) / 2
for i in range(N):
if X[i] < med:
print((Xsort[N // 2]))
else:
print((Xsort[N // 2-1]))
| p03379 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(eval(input()))
X = list(map(int, input().split()))
A = sorted(X)
med1 = A[N // 2 - 1]
med2 = A[N // 2]
for i, x in enumerate(X):
if x <= med1:
print(med2)
else:
print(med1) | N = int(eval(input()))
X = list(map(int, input().split()))
A = sorted(X)
med1 = A[N // 2 - 1]
med2 = A[N // 2]
for x in X:
if x <= med1:
print(med2)
else:
print(med1) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
for i in x:
print(((y[n // 2 - 1], y[n // 2])[i in y[: n // 2]])) | n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
a = y[n // 2 - 1]
b = y[n // 2]
for i in x:
print(((a, b)[i <= a])) | p03379 |
n = int(eval(input()))
xarray = list(map(int,input().split()))
newArray = xarray[:]
newArray.sort()
for item in xarray:
if newArray.index(item)<=int(n/2-1):
print((newArray[int(n/2)]))
else:
print((newArray[int(n/2)-1])) | n = int(eval(input()))
xarray = list(map(int,input().split()))
newArray = xarray[:]
newArray.sort()
left = newArray[n//2-1]
right = newArray[n//2]
for item in xarray:
if item<=left:
print(right)
else:
print(left) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(len(x)):
tmp_list = x.copy()
tmp_list.pop(i)
tmp_list.sort()
print((tmp_list[int(n/2-1)]))
| n = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
min_mid = sx[int(n/2-1)]
max_mid = sx[int(n/2)]
for i in x:
if i <= min_mid: # 左半分から取られてる時
print(max_mid)
else: # 右半分から取られてる時
print(min_mid)
| p03379 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
l=list(map(int,input().split()))
l2=sorted(l)
x=l2[n//2-1]
y=l2[n//2]
if x==y:
for i in range(n):
print(x)
else:
setx=set(l2[:n//2])
sety=set(l2[n//2:])
for i in l:
if i in setx:
print(y)
else:
print(x)
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n = int(eval(input()))
l = list(map(int, input().split()))
lsort = sorted(l)
left = lsort[n // 2 - 1]
right = lsort[n // 2]
for i in l:
if i <= left:
print(right)
else:
print(left)
resolve() | p03379 |
n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n//2 - 1]
b2 = lst[n//2]
for x in lst_x:
if x <= b1:
ans = b2
else:
ans = b1
print(ans) | n = int(eval(input()))
lst_x = list(map(int, input().split()))
lst = lst_x[:]
lst.sort()
b1 = lst[n//2 - 1]
b2 = lst[n//2]
for x in lst_x:
print((b2 if x <= b1 else b1))
| p03379 |
def main():
n = int(eval(input()))
x = [int(xn) for xn in input().split()]
x_sorted = sorted(x)
idx_median = (n - 1) // 2
for xn in x:
target = [*x_sorted]
target.remove(xn)
print((target[idx_median]))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
x = [int(xn) for xn in input().split()]
x_sorted = sorted(x)
idx_median = n // 2
median_low = x_sorted[idx_median - 1]
median_high = x_sorted[idx_median]
for xn in x:
print((median_high if xn <= median_low else median_low))
if __name__ == '__main__':
main()
| p03379 |
import copy
n = int(eval(input()))
x = list(map(int, input().split(" ")))
def medianIndex(l, i):
l.pop(i-1)
num = len(l)
l.sort()
m = int((num - 1) / 2)
print((l[m]))
for i in range(1,n+1):
temp = copy.copy(x)
medianIndex(temp, i) | import copy
n = int(eval(input()))
x = list(map(int, input().split(" ")))
y = copy.copy(x)
x.sort()
l = len(x)
m0 = x[int(l/2 - 1)]
m1 = x[int(l/2)]
for i in y:
if i <= m0:
print(m1)
else:
print(m0) | p03379 |
import sys
read = sys.stdin.buffer.read
n,*x = list(map(int, read().split()))
for i in range(0,n):
temp = []
try:
temp = x[:i]
except:
pass
try:
temp += x[i+1:]
except:
pass
temp.sort()
print((temp[n//2-1])) | import sys
read = sys.stdin.buffer.read
n,*x = list(map(int, read().split()))
x_sort = sorted(x)
mean_left = x_sort[n//2-1]
mean_right = x_sort[n//2]
for i in range(n):
if x[i] <= mean_left:
print(mean_right)
elif x[i] >= mean_right:
print(mean_left) | p03379 |
# ABC094C - Many Medians (ARC095C)
def main():
N, *X = map(int, open(0).read().split())
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC094C - Many Medians (ARC095C)
def main():
N, *X = list(map(int, open(0).read().split()))
l, h = sorted(X)[N // 2 - 1 : N // 2 + 1]
ans = [h if i <= l else l for i in X]
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main() | p03379 |
n = int(eval(input()))
ls = [x for x in map(int, input().split(' '))]
for x in range(0, n):
dam = ls.copy()
del dam[x]
dam = sorted(dam)
print((dam[int(len(dam)/ 2)])) | n = int(eval(input()))
ls = [x for x in map(int, input().split(' '))]
dam = sorted(ls.copy())
for x in range(0, n):
if ls[x] < dam[n // 2]:
print((dam[n // 2]))
else:
print((dam[(n // 2) - 1]))
| p03379 |
n = int(eval(input()))
xlst = list(map(int, input().split()))
for i in range(n):
x_ = xlst.copy()
x_.pop(i)
x_.sort(reverse=True)
print((x_[n//2-1]))
| n = int(eval(input()))
xl = list(map(int, input().split()))
xl_s = sorted(xl)
l = xl_s[n//2-1]
r = xl_s[n//2]
for x in xl:
if x >= r:
print(l)
else:
print(r)
| p03379 |
N=int(eval(input()))
x=list(map(int,input().split()))
l=[]
for i in range(N):
temp=[]
for j in range(N):
if i!=j:
temp.append(x[j])
l.append(temp)
length=N-1
for i in range(N):
l[i]=sorted(l[i])
print((l[i][(length+1)//2-1]))
| N=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
left=y[N//2-1]
right=y[N//2]
for i in x:
if i<=left:
print(right)
elif i>=right:
print(left) | p03379 |
#!/usr/bin/env python
# coding: utf-8
# In[2]:
import copy
# In[10]:
N = int(eval(input()))
X = list(map(int, input().split()))
# In[11]:
for i in range(N):
x_copy = copy.deepcopy(X)
del x_copy[i]
ans = sorted(x_copy)[N//2-1]
print(ans)
# In[ ]:
| #!/usr/bin/env python
# coding: utf-8
# In[25]:
N = int(eval(input()))
X = list(map(int, input().split()))
# In[26]:
x1 = sorted(X)[N//2-1]
x2 = sorted(X)[N//2]
for i in range(N):
if X[i] >= x2:
print(x1)
else:
print(x2)
# In[ ]:
| p03379 |
import copy
N = int(eval(input()))
X = list(map(int, input().split()))
S_X = copy.copy(X)
for i in range(N // 2 + 1):
for j in range(N - 1 - i):
if(S_X[j] > S_X[j + 1]):
tmp = S_X[j + 1]
S_X[j + 1] = S_X[j]
S_X[j] = tmp
# s_X = sorted(X)
miX = S_X[N // 2 - 1]
mi1X = S_X[N // 2]
# print(S_X, X)
# print(miX, mi1X)
# print(miX, mi1X)
# print(X)
for a in X:
if(a <= miX):
print(mi1X)
else:
print(miX) | # import copy
N = int(eval(input()))
X = list(map(int, input().split()))
# S_X = copy.copy(X)
S_X = sorted(X)
miX = S_X[N // 2 - 1]
mi1X = S_X[N // 2]
# print(S_X, X)
# print(miX, mi1X)
# print(miX, mi1X)
# print(X)
for a in X:
if(a <= miX):
print(mi1X)
else:
print(miX) | p03379 |
n = int(eval(input()))
argList = list(map(int, input().split()))
for i in range(len(argList)):
argList2 = argList.copy()
argList2.pop(i)
argList2.sort()
print((argList2[int(len(argList2)/2)]))
| n = int(eval(input()))
argList = list(map(int, input().split()))
argList2 = argList.copy()
argList2.sort()
med_before = argList2[int(len(argList2)/2)-2]
med = argList2[int(len(argList2)/2)-1]
med_after = argList2[int(len(argList2)/2)]
for a in argList:
if( a <= med):
print(med_after)
else:
print(med) | p03379 |
n=int(eval(input()))
x=list(map(int, input().split()))
ll=(len(x)-1)//2
for i in range(n):
xx=x.copy()
del xx[i]
xx=sorted(xx,reverse=True)
print((xx[ll])) | n=int(eval(input()))
x=list(map(int, input().split()))
xx=sorted(x,reverse=True)
ll=(len(x)-1)//2
for i in range(n):
if x[i]<xx[ll]:
print((xx[ll]))
else:
print((xx[ll+1])) | p03379 |
n=int(eval(input()))
x=list(map(int, input().split()))
xx=sorted(x,reverse=True)
ll=(len(x)-1)//2
for i in range(n):
if x[i]<xx[ll]:
print((xx[ll]))
else:
print((xx[ll+1])) | n=int(eval(input()))
x=list(map(int,input().split()))
l=sorted(x)
ans1=l[n//2]
ans2=l[n//2-1]
for i in x:
if i<=ans2:
print(ans1)
else:
print(ans2) | p03379 |
n = int(eval(input()))
X = list(map(int,input().split()))
X_sort = sorted(X)
for i in X:
if X_sort.index(i) < len(X)//2:
print((X_sort[len(X)//2]))
else: print((X_sort[len(X)//2-1]))
| n = int(eval(input()))
X = list(map(int,input().split()))
X_sort = sorted(X)
t = X_sort[len(X)//2]
for i in X:
if i < t:
print((X_sort[len(X)//2]))
else: print((X_sort[len(X)//2-1]))
| p03379 |
N = int(eval(input()))
X = [int(i) for i in input().split()]
for i in range(N):
start = i + 1
x = sorted(X[:i] + X[start:])
l = len(x)
b = (l + 1) // 2
print((x[b - 1]))
| n = int(eval(input()))
x = [int(i) for i in input().split()]
xsort = sorted(x)
l1 = xsort[n // 2 - 1]
l2 = xsort[n // 2]
for i in range(n):
print((l1 if x[i] >= l2 else l2))
| p03379 |
def main():
N = int(eval(input()))
X = [int(x) for x in input().split()]
Xsort = sorted(X)
for i in range(N):
if X[i] <= Xsort[N//2-1]:
print((Xsort[N//2]))
else:
print((Xsort[N//2-1]))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
for i in range(N):
if X[i] < Y[N//2]:
print((Y[N//2]))
else:
print((Y[N//2-1]))
if __name__ == '__main__':
# print(main())
main()
| p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
b=x.pop(i)
print((sorted(x)[int(n/2)-1]))
#print(a[int(n/2)-1])
x.insert(i,b) | N = int(eval(input()))
arr = list(map(int, input().split()))
X = arr.copy()
arr.sort()
for i in range(N):
if X[i] < arr[int(N/2)]:
print((arr[int(N/2)]))
else:
print((arr[int(N/2)-1])) | p03379 |
import bisect
n = int(eval(input()))
X = list(map(int, input().split()))
sorted_x = sorted(X)
l, r = sorted_x[n//2], sorted_x[n//2-1]
for x in X:
if bisect.bisect_left(sorted_x, x) < n // 2:
print(l)
else:
print(r) | n = int(eval(input()))
X = list(map(int, input().split()))
sorted_x = sorted(X)
l, r = sorted_x[n//2-1], sorted_x[n//2]
for x in X:
if x < r:
print(r)
else:
print(l) | p03379 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
p,q=b[n//2-1:n//2+1]
for i in a:print((p if i>=q else q))
| n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
p,q=b[n//2-1],b[n//2]
for i in a:print((p if i>=q else q))
| p03379 |
import copy
n = int(eval(input()))
x = list(map(int, input().split()))
middle = int(n/2) - 1
for i in range(n):
copy_list = copy.copy(x)
elm = copy_list.pop(i)
print((sorted(copy_list).pop(middle)))
| import copy
n = int(eval(input()))
x = list(map(int, input().split()))
sort_x = sorted(copy.copy(x))
middle = int(n/2) - 1
next_middle = middle + 1
for i in range(n):
if x[i] <= sort_x[middle]:
print((sort_x[next_middle]))
elif x[i] >= sort_x[next_middle]:
print((sort_x[middle]))
| p03379 |
def main():
c = int(eval(input())) // 2
elem = list(map(int, input().split()))
right, left = sorted(elem)[c - 1:c + 1]
for val in elem:
print((median(val, right, left)))
def median(val, right, left):
if right == left:
return right
elif val <= right:
return left
else:
return right
if __name__ == '__main__':
main()
| def main():
c = int(eval(input())) // 2
elem = list(map(int, input().split()))
right, left = sorted(elem)[c - 1:c + 1]
for val in elem:
print((median(val, right, left)))
def median(val, right, left):
if val <= right:
return left
else:
return right
if __name__ == '__main__':
main()
| p03379 |
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
n = int(eval(input()))
X = readInts()
import statistics
for i in range(n):
A = (X[:i] + X[i+1:] if i+1 < n else X[:i])
print((statistics.median(A)))
if __name__ == '__main__':
main()
| #import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
n = int(eval(input()))
X = readInts()
A = sorted(X)[n//2-1:n//2+1] # 中央値のどちらか
#print(A)
for x in X:
#print(x <= A[0]) # False 0 True 1
print((A[x <= A[0]])) # 1
if __name__ == '__main__':
main()
| p03379 |
n=int(eval(input()))
pos=n//2-1
arr=list(map(int,input().split()))
for i in range(n):
arr[i]=[arr[i],i]
arr=sorted(arr,key=lambda x:x[0])
ans=[0]*n
for i in range(n):
tmp=arr[:i]+arr[i+1:]
ans[arr[i][1]]=tmp[pos][0]
for i in range(n):
print((ans[i])) | n=int(eval(input()))
pos=n//2-1
arr=list(map(int,input().split()))
for i in range(n):
arr[i]=[arr[i],i]
arr=sorted(arr,key=lambda x:x[0])
ans=[0]*n
for i in range(n):
if i<=pos:
ans[arr[i][1]]=arr[pos+1][0]
else:
ans[arr[i][1]]=arr[pos][0]
for i in range(n):
print((ans[i])) | p03379 |
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = sorted(a)
def seach(x):
l = 0
r = n - 1
while True:
i = (l + r) // 2
if r - l <= 1:
if b[r] == x:
return r
else:
return l
if b[i] < x:
l = i
elif b[i] > x:
r = i
else:
return i
for i in range(n):
j = seach(a[i])
c = b[:j] + b[j+1:]
print((c[n // 2 - 1]))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
b = sorted(a)
for i in range(n):
if a[i] <= b[n // 2 - 1]:
print((b[n // 2]))
elif a[i] > b[n // 2 - 1]:
print((b[n // 2 - 1]))
if __name__ == '__main__':
main() | p03379 |
from statistics import median
n = int(eval(input()))
x = list(map(int, input().split()))
def naive(x):
return [median(x[:i] + x[i+1:]) for i in range(len(x))]
for i in naive(x):
print(i) | n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
a = y[len(x)//2]
b = y[(len(x)//2) - 1]
for i in range(n):
if x[i] <= b:
print(a)
else:
print(b)
| p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
ls = x[:(i)] + x[(i+1):]
ls.sort()
print((ls[int(n/2-1)])) | n = int(eval(input()))
x = list(map(int,input().split()))
ls = sorted(x)
a = ls[int(n/2-1)]
b = ls[int(n/2)]
for i in range(n):
if x[i] >=b:
print(a)
else:
print(b) | p03379 |
n=int(eval(input()))
x=tuple(list(map(int,input().split())))
b=tuple(sorted(x))
m=(n-1+1)//2-1
for i in x:
if b.index(i)<=m:print((b[m+1]))
else:print((b[m])) | n=int(eval(input()))
x=list(map(int,input().split()))
b=sorted(x)
m=(n-1+1)//2-1
for i in x:
if i<=b[m]:print((b[m+1]))
else:print((b[m]))
| p03379 |
from copy import copy
n = int(eval(input()))
x = list(map(int,input().split()))
x_sorted = sorted(x)
for i in range(n):
l = x_sorted.copy()
l.remove(x[i])
print((l[int(n/2)-1]))
| n = int(eval(input()))
x = list(map(int,input().split()))
x_sorted = sorted(x)
med = (x_sorted[int(n/2)-1] + x_sorted[int(n/2)])/2
for i in range(n):
if x[i]<med:
print((x_sorted[int(n/2)]))
else:
print((x_sorted[int(n/2)-1]))
| p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
a = x[:i] + x[i+1:]
a.sort(reverse=True)
print((a[n//2-1])) | n = int(eval(input()))
x = list(map(int,input().split()))
sx = sorted(x)
for i in range(n):
if x[i] < sx[n//2]:
print((sx[n//2]))
else:
print((sx[n//2-1])) | p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
num=[i+1 for i in range(N)]
l=list(zip(num,X))
l=sorted(l,key=lambda x:x[1])
indexlist=[]
for i in range(N):
indexlist.append(l[i][0])
for i in range(N):
x=indexlist.index(i+1)
if x<=N//2-1:
ans=l[N//2][1]
else:
ans=l[N//2-1][1]
print(ans) | N=int(eval(input()))
X=list(map(int,input().split()))
# Xをソート(Xsort)
# 除く数字が中央より左の場合、答えは中央右(r)の数字
# 逆も然り
Xsort=sorted(X)
l=(N-1)//2
r=l+1
th=Xsort[l]
for i in range(N):
if X[i]<=th:
ans=Xsort[r]
else:
ans=Xsort[l]
print(ans) | p03379 |
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(n):
b = list(a)
del b[i]
b.sort()
print((b[int((n - 1) / 2)])) | n = int(eval(input()))
a = list(map(int, input().split()))
b = sorted(a)
m1 = b[n // 2]
m2 = b[n // 2 - 1]
for num in a:
if(num < m1):
print(m1)
else:
print(m2) | p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
xx = x[:i] + x[i+1:]
xx.sort()
print((xx[n//2 - 1]))
| n = int(eval(input()))
x = list(map(int,input().split()))
y = list(x)
y.sort()
z = n // 2 - 1
a = y[z]
b = y[z + 1]
for i in x:
if i <= a :
ans = b
else:
ans = a
print(ans)
| p03379 |
N = int(eval(input()))
X = [int(i) for i in input().split()]
a, b = list(sorted(X))[N // 2 - 1:N // 2 + 1]
for x in X:
print((b if x <= a else a)) | N = int(eval(input()))
X = [int(i) for i in input().split()]
a, b = sorted(X)[N // 2 - 1:N // 2 + 1]
for x in X:
print((b if x <= a else a)) | p03379 |
from operator import itemgetter
n = int(eval(input()))
x = list(map(int, input().split()))
idx = [i for i in range(n)]
c = list(zip(x, idx))
c = sorted(c,key=itemgetter(0))
x, idx = list(zip(*c))
medi1 = x[len(x)//2]
medi2 = x[len(x)//2-1]
for i in range(len(x)):
if idx.index(i)<len(x)//2:
print(medi1)
else:
print(medi2) | from operator import itemgetter
n = int(eval(input()))
x = list(map(int, input().split()))
x = [(j, i) for i, j in enumerate(x)]
x.sort(key=itemgetter(0))
medi1 = x[len(x)//2][0]
medi2 = x[len(x)//2-1][0]
ans = [0]*n
for i in range(len(x)):
if i<len(x)//2:
ans[x[i][1]] = medi1
else:
ans[x[i][1]] = medi2
for a in ans:
print(a) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
m = (n-1)//2
l = sorted(x)
for i in x:
if i > l[m]: print((l[m]))
else: print((l[m+1])) | n = int(eval(input()))
x = list(map(int, input().split()))
l = sorted(x)
m1 = l[(n-1)//2]
m2 = l[(n-1)//2+1]
for i in x:
if i <= m1: print(m2)
else: print(m1) | p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
L = x[:i] + x[i+1:]
M = sorted(L)
print((M[n//2-1])) | n = int(eval(input()))
x = list(map(int,input().split()))
y = sorted(x)
for i in range(n):
if x[i] <= y[n//2-1]:
print((y[n//2]))
else:
print((y[n//2-1])) | p03379 |
import statistics
n = int(eval(input()))
x = list(map(int, input().split()))
print((statistics.median(x[1:])))
for i in range(1,n-1):
print((statistics.median(x[0:i]+x[i+1:])))
print((statistics.median(x[0:n-1])))
| import statistics
n = int(eval(input()))
x = list(map(int, input().split()))
high = statistics.median_high(x)
low = statistics.median_low(x)
for i in range(n):
if x[i]<= low:
print(high)
else:
print(low) | p03379 |
import sys
import statistics
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
X = list(map(int, readline().split()))
sort_X = sorted(X)
for i in range(N):
median = statistics.median(X[:i]+X[i+1:])
print(median)
if __name__ == '__main__':
main() | import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
X = list(map(int, readline().split()))
sort_X = sorted(X)
if N%2==0:
med_l = sort_X[N//2-1]
med_r = sort_X[N//2]
for i in range(N):
if X[i]<=med_l:
print(med_r)
else:
print(med_l)
else:
l = sort_X[N//2-1]
m = sort_X[N//2]
r = sort_X[N//2+1]
for i in range(N):
if X[i]<=l:
print(((m+r)/2))
elif X[i]==m:
print(((l+r)/2))
else:
print(((l+m)/2))
if __name__ == '__main__':
main() | p03379 |
from statistics import median
N = int(eval(input()))
num_lis = [int(_) for _ in input().split()]
for i in range(N):
print((median(num_lis[:i] + num_lis[i + 1:]))) |
N = int(eval(input()))
X = [int(_) for _ in input().split()]
tmp = sorted(X)
one = N // 2 - 1
two = N // 2
for x in X:
if x <= tmp[one]:
print((tmp[two]))
else:
print((tmp[one])) | p03379 |
import statistics
import copy
N = int(eval(input()))
X = list(map(int,input().split(" ")))
Y = copy.deepcopy(X)
Y.sort()
for i in range(N):
Z = copy.deepcopy(Y)
Z.remove(X[i])
print((Z[N//2-1]))
| import copy
N = int(eval(input()))
X = list(map(int,input().split(" ")))
Y = copy.deepcopy(X)
Y.sort()
B = (Y[N//2]+Y[N//2-1])/2
for i in range(N):
if X[i] <= B:
print((Y[N//2]))
else:
print((Y[N//2-1]))
| p03379 |
N = int(eval(input()))
X = [int(x) for x in input().split()]
ind = [i for i in range(N)]
# XのindexをXが昇順になるように並び替える
ind = sorted(ind, key = lambda i : X[i])
ans = [0] * N
for i in range(N // 2):
ans[ind[i]] = X[ind[N // 2]]
for i in range(N // 2, N):
ans[ind[i]] = X[ind[N // 2 - 1]]
for i in range(N):
print((ans[i])) | N = int(eval(input()))
X = [int(x) for x in input().split()]
Y = sorted(X)
for i in range(N):
if X[i] < Y[N // 2]:
print((Y[N // 2]))
else:
print((Y[N // 2 - 1])) | p03379 |
def main():
n = int(eval(input()))
num_list = list(map(int, input().split()))
num_list_copy = num_list[:]
num_list.sort()
s_num_list = num_list[:]
for i in range(n):
num_list.remove(num_list_copy[i])
print((num_list[(n-2)//2]))
num_list = s_num_list[:]
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
num_list = list(map(int, input().split()))
c_num_list = num_list[:]
num_list.sort()
for i in range(n):
tmp = num_list[n//2]
if c_num_list[i] >= tmp:
print((num_list[n//2-1]))
else:
print((num_list[n//2]))
if __name__ == '__main__':
main() | p03379 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
xn = list(map(int, input().split()))
xn_sorted = sorted(xn)
for xi in xn:
xn_tmp = list(xn_sorted)
xn_tmp.remove(xi)
print((xn_tmp[(len(xn_tmp)+1)//2 -1]))
| # -*- coding: utf-8 -*-
N = int(eval(input()))
xn = list(map(int, input().split()))
xn_sorted = sorted(xn)
val_a = xn_sorted[(len(xn_sorted))//2 - 1]
val_b = xn_sorted[(len(xn_sorted))//2]
for xi in xn:
if xi <= val_a:
print(val_b)
else:
print(val_a)
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
t = sorted(x)
for i in range(n):
j = t.index(x[i])
s = t[:j] + t[j + 1:]
print((s[n // 2 - 1])) | n = int(eval(input()))
x = list(map(int, input().split()))
t = sorted(x)
mid1, mid2 = t[n // 2 - 1], t[n // 2]
for i in range(n):
if x[i] <= mid1:
print(mid2)
else:
print(mid1)
| p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(len(X)):
Y = X[:i] + X[i+1:]
Y.sort()
print((Y[int(N/2)-1])) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
for i in range(len(X)):
candi = Y[int(N/2)-1]
if X[i] <= candi:
print((Y[int(N/2)]))
else:
print(candi) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(N):
X_1 = X[:i] + X[i+1:]
X_1.sort()
print((X_1[N//2-1])) | N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
a = Y[(N-1)//2]
b = Y[(N+1)//2]
for i in X:
if i > a:
print(a)
else:
print(b) | p03379 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
xs = sorted(x)
for i in range(n):
xi = xs.copy()
xi.remove(x[i])
print((xi[n // 2 - 1])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
xs = sorted(x)
d = dict()
for i in range(n):
if xs[i] not in d:
d[xs[i]] = i
for i in range(n):
print((xs[n // 2 - int(d[x[i]] >= n // 2)])) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
A = []
for i in range(N):
j = Y.index(X[i])
A.append((Y[:j] + Y[j+1:])[(N-1)//2])
print(('\n'.join(map(str, A)))) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
l, r = Y[N//2-1], Y[N//2]
A = []
for i in range(N):
if X[i] <= l:
A.append(r)
else:
A.append(l)
print(('\n'.join(map(str, A)))) | p03379 |
# See:
# https://qiita.com/suecharo/items/30f5d817da4c948c3be6
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
# ここで分割を行う
left = arr[:mid]
right = arr[mid:]
# 再帰的に分割を行う
left = merge_sort(left)
right = merge_sort(right)
# returnが返ってきたら、結合を行い、結合したものを次に渡す
return merge(left, right)
def merge(left, right):
merged = []
l_i, r_i = 0, 0
# ソート済み配列をマージするため、それぞれ左から見ていくだけで良い
while l_i < len(left) and r_i < len(right):
# ここで=をつけることで安定性を保っている
if left[l_i] <= right[r_i]:
merged.append(left[l_i])
l_i += 1
else:
merged.append(right[r_i])
r_i += 1
# 上のwhile文のどちらかがFalseになった場合終了するため、あまりをextendする
if l_i < len(left):
merged.extend(left[l_i:])
if r_i < len(right):
merged.extend(right[r_i:])
return merged
if __name__ == '__main__':
n = int(eval(input()))
x = list(map(int, input().split()))
order = list(x)
for i in range(n):
tmp = order[i]
x.remove(tmp)
x = merge_sort(x)
print((x[(n // 2) - 1]))
x += [tmp]
| # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem C
if __name__ == '__main__':
n = int(eval(input()))
x = list(map(int, input().split()))
sorted_x = sorted(x)
low = sorted_x[(n // 2) - 1]
high = sorted_x[(n // 2)]
for i in range(n):
if x[i] < high:
print(high)
else:
print(low)
| p03379 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(len(a)):
b=a.copy()
del b[i]
b.sort()
print((b[(len(a)//2)-1])) | n,a=int(eval(input())),list(map(int,input().split()))
b=sorted(a[:])
x,y=b[n//2-1],b[n//2]
for i in a:print((x if i>x else y)) | p03379 |
import statistics
n = int(eval(input()))-1
a = list(map(int, input().split()))
N = sorted([[x,y] for y, x in enumerate(a)])
ans = [0] * (n+1)
for i in range(n+1):
if i < n//2+1:
ans[N[i][1]] = N[n//2+1][0]
else: ans[N[i][1]] = N[n//2][0]
for x in ans: print(x) | n = int(eval(input()))
x = list(enumerate(map(int, input().split())))
x.sort(key=lambda x:x[1])
ans = [""]*n
for i in range(n):
if (n+1)//2 >= i+1: ans[x[i][0]] = x[(n+1)//2][1]
else: ans[x[i][0]] = x[(n+1)//2-1][1]
print(("\n".join(map(str, ans)))) | p03379 |
import statistics
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
print((statistics.median(x[:i]+x[i+1:]))) | n = int(eval(input()))
x = list(enumerate(map(int, input().split())))
x.sort(key=lambda x:x[1])
ans = [""]*n
for i in range(n):
if (n+1)//2 >= i+1: ans[x[i][0]] = x[(n+1)//2][1]
else: ans[x[i][0]] = x[(n+1)//2-1][1]
print(("\n".join(map(str, ans)))) | p03379 |
n = int(eval(input()))
x = list(enumerate(map(int, input().split())))
x.sort(key=lambda x:x[1])
ans = [""]*n
for i in range(n):
if (n+1)//2 >= i+1: ans[x[i][0]] = x[(n+1)//2][1]
else: ans[x[i][0]] = x[(n+1)//2-1][1]
print(("\n".join(map(str, ans)))) | n = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X)
l = x[n//2-1]
r = x[n//2]
for i in range(n):
if X[i] <= l:
print(r)
else:
print(l) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
X = sorted(x)
for i in x:
I = X.index(i)
l,r = I, n-I
if I+1 <= n//2:
print((X[I+n//2-l]))
else:
print((X[n//2-1])) | n = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X)
l = x[n//2-1]
r = x[n//2]
for i in range(n):
if X[i] <= l:
print(r)
else:
print(l)
| p03379 |
#ABC 094 Many Medians
numbers=int(eval(input()))
list_num=[int(i) for i in input().split()]
sorted_list=sorted(list_num)
median1=sorted_list[int(numbers/2)-1]
median2=sorted_list[int(numbers/2)]
for i in list_num:
if sorted_list.index(i) <= numbers/2-1:
print(median2)
else:
print(median1) | numbers=int(eval(input()))
list_num=[int(i) for i in input().split()]
sorted_list=sorted(list_num)
median1=sorted_list[int(numbers/2)-1]
median2=sorted_list[int(numbers/2)]
for i in list_num:
if i <= median1:
print(median2)
else:
print(median1) | p03379 |
import statistics
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
print((statistics.median(X[0:i]+X[i+1:N]))) | N = int(eval(input()))
X = list(map(int, input().split()))
t = sorted(X)
for i in range(N):
if X[i] <= t[N // 2 - 1]:
print((t[N//2]))
else:
print((t[N//2-1])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
w = x[:i] + x[i+1:]
w.sort()
print((w[((len(w)+1)//2)-1])) | n = int(eval(input()))
x = list(map(int, input().split()))
w = tuple(x)
x.sort()
if x[(n//2)-1] == x[n//2]:
for i in range(n):
print((x[n//2]))
else:
for h in w:
if h <= x[(n//2)-1]:
print((x[n//2]))
else:
print((x[(n//2)-1])) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
m=n//2 - 1
for i in range(n):
a=sorted(x[:i]+x[i+1:])
print((a[m])) | n=int(eval(input()))
x=list(map(int,input().split()))
arr=sorted(x)[n//2-1:n//2+1]
for i in range(n):
if x[i]<=arr[0]:
print((arr[1]))
elif x[i]>=arr[1]:
print((arr[0])) | p03379 |
import statistics
n = int(eval(input()))
x = [int(x) for x in input().split()]
#m = (n // 2) - 1
for i in range(n):
l = x[:i] + x[i+1:]
# l.sort()
print((statistics.median(l)))
#print(l[m]) | n = int(eval(input()))
x = [int(x) for x in input().split()]
s = sorted(x)
for i in range(n):
if x[i] <= s[n//2 - 1]:
print((s[n//2]))
else:
print((s[n//2 - 1])) | p03379 |
# author: kagemeka
# created: 2019-11-07 11:52:43(JST)
import sys
# import collections
# import math
# import string
import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
n, *x = (int(i) for i in sys.stdin.read().split())
s_x = list(sorted(x))
half = n // 2
m_s, m_l = s_x[half -1], s_x[half]
for i in x:
b = bisect.bisect_left(s_x, i)
print((m_l if b < half else m_s))
if __name__ == "__main__":
# execute only if run as a script
main()
| # author: kagemeka
# created: 2019-11-07 11:52:43(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
def main():
n, *x = (int(i) for i in sys.stdin.read().split())
s_x = list(sorted(x))
half = n // 2
m_s, m_l = s_x[half - 1], s_x[half]
for i in x:
print((m_l if i < m_l else m_s))
if __name__ == "__main__":
# execute only if run as a script
main()
| p03379 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {id(v): k for k, v in list(inspect.currentframe().f_back.f_locals.items())}
print((', '.join(names.get(id(arg), '???')+' = '+repr(arg) for arg in args)))
# Binary converter
def to_bin(x):
return bin(x)[2:]
def li_input():
return [int(_) for _ in input().split()]
# --------------------------------------------
dp = None
def main():
N = int(eval(input()))
X = li_input()
sX = sorted(X)
for x in X:
if sX.index(x) < len(sX) // 2:
print((sX[len(sX) // 2]))
else:
print((sX[len(sX) // 2 - 1]))
main()
| import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(10000)
# Debug output
def chkprint(*args):
names = {id(v): k for k, v in list(inspect.currentframe().f_back.f_locals.items())}
print((', '.join(names.get(id(arg), '???')+' = '+repr(arg) for arg in args)))
# Binary converter
def to_bin(x):
return bin(x)[2:]
def li_input():
return [int(_) for _ in input().split()]
# --------------------------------------------
dp = None
def main():
N = int(eval(input()))
X = li_input()
sX = sorted(X)
med = sX[len(sX) // 2]
med_min = sX[len(sX) // 2 - 1]
for x in X:
if x < med:
print(med)
else:
print(med_min)
main()
| p03379 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode
INF = float("inf")
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def mycount(ls,x):
# lsはソート済みであること
l = bisect_left(ls,x)
r = bisect_right(ls,x)
return (r-l)
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
def I():
return int(eval(input()))
def MI():
return list(map(int,input().split()))
def RI():
return list(map(int,input().split()))
def CI(n):
return [ int(eval(input())) for _ in range(n) ]
def LI(n):
return [ list(map(int,input().split())) for _ in range(n) ]
def S():
return eval(input())
def MS():
return input().split()
def RS():
return list(eval(input()))
def CS(n):
return [ eval(input()) for _ in range(n) ]
def LS(n):
return [ list(eval(input())) for _ in range(n) ]
# ddict = defaultdict(lambda: 0)
# ddict = defaultdict(lambda: 1)
# ddict = defaultdict(lambda: int())
# ddict = defaultdict(lambda: list())
# ddict = defaultdict(lambda: float())
n = I()
x = RI()
for i in range(n):
t = x[i]
x.pop(i)
ans = median(x)
x.insert(i,t)
print(ans)
exit() | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode
INF = float("inf")
def mycol(data,col):
return [ row[col] for row in data ]
def mysort(data,col,reverse_flag):
data.sort(key=lambda x:x[col],reverse=reverse_flag)
return data
def mymax(data):
M = -1*float("inf")
for i in range(len(data)):
m = max(data[i])
M = max(M,m)
return M
def mymin(data):
m = float("inf")
for i in range(len(data)):
M = min(data[i])
m = min(m,M)
return m
def mycount(ls,x):
# lsはソート済みであること
l = bisect_left(ls,x)
r = bisect_right(ls,x)
return (r-l)
def myoutput(ls,space=True):
if space:
if len(ls)==0:
print(" ")
elif type(ls[0])==str:
print((" ".join(ls)))
elif type(ls[0])==int:
print((" ".join(map(str,ls))))
else:
print("Output Error")
else:
if len(ls)==0:
print("")
elif type(ls[0])==str:
print(("".join(ls)))
elif type(ls[0])==int:
print(("".join(map(str,ls))))
else:
print("Output Error")
def I():
return int(eval(input()))
def MI():
return list(map(int,input().split()))
def RI():
return list(map(int,input().split()))
def CI(n):
return [ int(eval(input())) for _ in range(n) ]
def LI(n):
return [ list(map(int,input().split())) for _ in range(n) ]
def S():
return eval(input())
def MS():
return input().split()
def RS():
return list(eval(input()))
def CS(n):
return [ eval(input()) for _ in range(n) ]
def LS(n):
return [ list(eval(input())) for _ in range(n) ]
# ddict = defaultdict(lambda: 0)
# ddict = defaultdict(lambda: 1)
# ddict = defaultdict(lambda: int())
# ddict = defaultdict(lambda: list())
# ddict = defaultdict(lambda: float())
n = I()
x = RI()
a = sorted(x)
M = a[n//2]
m = a[n//2-1]
for i in range(n):
if x[i]<=m:
print(M)
else:
print(m)
exit() | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
tmp = x[:i]+x[i+1:]
# print(tmp)
print((sorted(tmp)[(n-1)//2])) | n = int(eval(input()))
x = list(map(int, input().split()))
x_s = sorted(x)
med2 = x_s[n//2]
med1 = x_s[n//2-1]
for i in range(n):
if x[i]<=med1:
print(med2)
else:
print(med1) | p03379 |
import math
import statistics
N=int(eval(input()))
X=input().split()
Y=[int(a) for a in X]
Z=tuple(Y)
for a in range(N):
b=Z[a]
answer=list(Z)
answer.remove(b)
answer=sorted(answer)
print((answer[int(N/2-1)]))
| N=int(eval(input()))
X=input().split()
Y=[int(a) for a in X]
Z=sorted(Y)
a=Z[int(N/2-1)]
b=Z[int(N/2)]
for c in range(N):
if Y[c]<=a:
print(b)
else:
print(a)
| p03379 |
N = int(eval(input()))
lst = list(map(int, input().split()))
a = sorted(lst)
center_m = a[N//2 - 1]
center_p = a[N//2]
#print (center_m, center_p)
for i in lst:
if i <= center_m:
print (center_p)
else:
print (center_m) | N = int(eval(input()))
X = list(map(int, input().split()))
X_sort = sorted(X)
tmp_m = X_sort[N // 2 - 1]
tmp_p = X_sort[N // 2]
for x in X:
if x <=tmp_m:
print (tmp_p)
else:
print (tmp_m) | p03379 |
import copy
n = int(eval(input()))
x = [int(i) for i in input().split()]
sortedx = copy.copy(x)
sortedx.sort()
m = {}
for i in x:
if i in m:
print((m[i]))
else:
cnt = 0
flag = False
for j in range(n):
if i == sortedx[j] and not flag:
flag = True
elif cnt == (n/2)-1:
print((sortedx[j]))
m[i] = sortedx[j]
break
else:
cnt += 1
| import copy
n = int(eval(input()))
x = [int(i) for i in input().split()]
sortedx = copy.copy(x)
sortedx.sort()
m = sortedx[int((n+1)/2)]
for i in x:
if i < m:
print((sortedx[int(n/2)]))
else:
print((sortedx[int(n/2-1)])) | p03379 |
import copy
n = int(eval(input()))
x = [int(i) for i in input().split()]
sortedx = copy.copy(x)
sortedx.sort()
m = sortedx[int((n+1)/2)]
for i in x:
if i < m:
print((sortedx[int(n/2)]))
else:
print((sortedx[int(n/2-1)])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
sortedx = sorted(x)
r = sortedx[n//2]
l = sortedx[n//2-1]
for i in x:
if i < r:
print(r)
else:
print(l) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
memo = x.pop(i)
b = sorted(x)
print((b[int(n/2) - 1]))
x.insert(i, memo) | n = int(eval(input()))
x = list(map(int, input().split()))
b = sorted(x)
m_left = b[int(n//2) -1]
m_right = b[int(n//2)]
for i in range(n):
if x[i] <= m_left:
print(m_right)
elif x[i] >= m_right:
print(m_left) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
def median(L):
L = sorted(L)
n = len(L)
m = int(n/2)
if n % 2 == 0:
return (L[m - 1] + L[m]) / 2
else:
return L[(n - 1) // 2]
x_median = median(x)
l = median(sorted(x)[:-1])
r = median(sorted(x)[1:])
for i in range(n):
if x[i] > x_median:
print(l)
else:
print(r) | n = int(eval(input()))
x = list(map(int, input().split()))
x_sort = sorted(x)
def median(L):
#L = sorted(L)
n = len(L)
m = int(n/2)
if n % 2 == 0:
return (L[m - 1] + L[m]) / 2
else:
return L[(n - 1) // 2]
x_median = median(x_sort)
l = median(x_sort[:-1])
r = median(x_sort[1:])
for i in range(n):
if x[i] > x_median:
print(l)
else:
print(r) | p03379 |
import sys
import statistics
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
X = list(map(int, input().split()))
mid = N // 2 - 1
for i in range(N):
print((statistics.median(X[:i]+X[i+1:])))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
X = list(map(int, input().split()))
X_sorted = sorted(X)
L = X_sorted[N//2-1]
R = X_sorted[N//2]
for x in X:
print((L if x >= R else R))
| p03379 |
import copy
import statistics
n = int(eval(input()))
x = [int(y) for y in input().split()]
z = copy.deepcopy(x)
for i in range(n):
x.pop(i)
print((statistics.median(x)))
x.insert(i, z[i]) | import copy
import statistics
n = int(eval(input()))
x = [int(y) for y in input().split()]
z = copy.deepcopy(x)
z.sort()
t = (z[int(n / 2) - 1] + z[int(n / 2)]) / 2
for i in range(n):
if x[i] < t:
print((z[int(n / 2)]))
else:
print((z[int(n / 2) - 1])) | p03379 |
import sys
import copy
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return list(map(int, stdin.readline().split()))
def nl(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
X = nl()
X_s = sorted(X)
for i in range(n):
X_s_c = copy.copy(X_s)
X_s_c.remove(X[i])
print((X_s_c[(n - 1) // 2]))
if __name__ == '__main__':
main()
| import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return list(map(int, stdin.readline().split()))
def nl(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
X = nl()
X_s = sorted(X)
mid = X_s[n // 2]
del_mid = (X_s[:n // 2] + X_s[n // 2 + 1:])[(n - 1) // 2]
for x in X:
if x < mid:
print(mid)
elif x > mid:
print((X_s[n // 2 - 1]))
else:
print(del_mid)
if __name__ == '__main__':
main()
| p03379 |
n = int(eval(input()))
X = list(map(int, input().split()))
for i in range(n):
if i !=0 and i != n-1:
l = X[:i] + X[i+1:]
elif i == 0:
l = X[1:]
else:
l = X[:n-1]
l.sort()
print((l[n // 2 - 1]))
| n = int(eval(input()))
X = list(map(int, input().split()))
X_mid = sorted(X)[n//2 - 1: n//2 + 1]
for i in X:
print((X_mid[i <= X_mid[0]])) # Falseなら1、Trueなら0
| p03379 |
# input
N = int(eval(input()))
X = list(map(int, input().split()))
# check
center = N // 2 - 1
for ind in range(N):
if ind == 0:
target = X[1:]
elif ind == N - 1:
target = X[:ind]
else:
target = X[:ind] + X[ind + 1:]
target.sort()
print((target[center])) | # input
N = int(eval(input()))
X = list(map(int, input().split()))
# check
l, r = N // 2 - 1, N // 2
sort_x = sorted(X)
lx, rx = sort_x[l], sort_x[r]
if lx == rx:
for i in range(N):
print(lx)
else:
for ind in range(N):
target = X[ind]
if target <= lx:
print(rx)
if target >= rx:
print(lx)
| p03379 |
from statistics import median
from operator import itemgetter
N = int(eval(input()))
x = list(map(int, input().split()))
y = [x for x in range(N)]
z = list(zip(x, y))
z.sort()
x_, y = list(zip(*z))
val = N//2
for i in range(N):
if list(y).index(i) < val:
print((x_[val]))
else:
print((x_[val-1]))
| from statistics import median
from operator import itemgetter
N = int(eval(input()))
x = list(map(int, input().split()))
x_ = sorted(x)
m0 = median(x_[1:])
m1 = median(x_[:-1])
for i in x:
if m1 >= i:
print(m0)
else:
print(m1)
| p03379 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
for i in range(n):
y = x[:i]+x[i+1:]
y_new = sorted(y)
print((y_new[n//2-1])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
x_new = sorted(x)
med1 = x_new[n//2]
med2 =x_new[n//2-1]
for i in range(n):
if x[i] < med1:
print(med1)
else:
print(med2) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
argsort = [[x, i] for i, x in enumerate(X)]
argsort.sort()
argsort = [[i, j] for j, [_, i], in enumerate(argsort)]
argsort.sort()
ranks = [j + 1 for _, j in argsort]
indices = [[x, i] for i, x in enumerate(X)]
indices.sort()
indices = {(i + 1): x for i, (x, _) in enumerate(indices)}
median = N // 2
for i in range(0, N):
r = ranks[i]
if r <= median:
print((indices[median + 1]))
else:
print((indices[median]))
| N = int(eval(input()))
X = list(map(int, input().split()))
argsort = [[x, i] for i, x in enumerate(X)]
argsort.sort()
indices = {(i + 1): x for i, (x, _) in enumerate(argsort)}
argsort = [[i, j] for j, [_, i], in enumerate(argsort)]
argsort.sort()
ranks = [j + 1 for _, j in argsort]
median = N // 2
for i in range(0, N):
r = ranks[i]
if r <= median:
print((indices[median + 1]))
else:
print((indices[median]))
| p03379 |
n = int(eval(input()))
xx = list(map(int, input().split()))
for i in range(n):
yy = xx[:i] + xx[i+1:]
zz = sorted(yy)
print((zz[(n-1)//2])) | n = int(eval(input()))
xx = list(map(int, input().split()))
yy = sorted(xx)
a = yy[n//2-1]
b = yy[n//2]
for x in xx:
if x <= a:
print(b)
elif x >= b:
print(a) | p03379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.