input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from statistics import median
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
Y = X[:i] + X[i+1:]
print((median(Y))) | 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 range(N):
if X[i] <= a:
print(b)
else:
print(a) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
sX = sorted(X)
tsX = sX[:]
k = int(N/2-1)
for i in range(N):
tsX.remove(X[i])
print((tsX[k]))
tsX = sX[:]
| N = int(eval(input()))
X = list(map(int,input().split()))
sX = sorted(X)
m1 = sX[int(N/2-1)]
m2 = sX[int(N/2)]
for i in X:
if i<=m1:
print(m2)
else:
print(m1) | p03379 |
import copy
N = int(eval(input()))
X = list(map(int, input().split()))
XX = sorted(X)
for i in range(N):
delX = copy.copy(XX)
delX.remove(X[i])
# print(delX)
print((delX[N // 2 - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
for x in X:
if x <= Y[N // 2 - 1]:
print((Y[N // 2]))
else:
print((Y[N // 2 - 1])) | p03379 |
import sys
if __name__ == "__main__":
N = int(eval(input()))
X = list(map(int, (input().split(' '))))
for i in range(N):
buf = list(X)
buf.pop(i)
buf = sorted(buf)
print((buf[int(N/2)-1])) | import sys
if __name__ == "__main__":
N = int(eval(input()))
X = list(map(int, (input().split(' '))))
buf = sorted(X)
for i in range(N):
# buf = list(X)
# buf.pop(i)
# buf = sorted(buf)
# print(X[i])
# print(buf[int(N/2)])
if X[i] < buf[int(N/2)]:
print((buf[int(N/2)]))
else:
print((buf[int(N/2)-1])) | p03379 |
import statistics
import copy
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
buf = copy.copy(X)
buf.pop(i)
print((statistics.median(buf))) | 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:
if i <= a:
print(b)
elif i >= b:
print(a) | p03379 |
#-*-coding:utf-8-*-
import statistics
import copy
def median(tmp_numbers):
return statistics.median(tmp_numbers)
def main():
numbers=[]
n = int(eval(input()))
numbers=list(map(int,input().split()))
for i in range(n):
tmp_numbers=copy.deepcopy(numbers)
tmp_numbers.pop(i)
ans = median(tmp_numbers)
print(ans)
if __name__=="__main__":
main() | #-*-coding:utf-8-*-
def main():
numbers=[]
n = int(eval(input()))
numbers=list(map(int,input().split()))
sort_numbers=sorted(numbers)
# left/right算出はsorted arrayで
left=sort_numbers[n//2-1]
right=sort_numbers[n//2]
# loopは元の配列で
for i in numbers:
if i > left:
print(left)
else:
print(right)
if __name__=="__main__":
main() | p03379 |
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
N=ri()
X=rl()
Xs = sorted(X)
Xsl = Xs[:N//2]
Xsr = Xs[N//2:]
for x in X:
if x in Xsl:
print(Xsr[0])
else:
print(Xsl[-1])
| ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
N=ri()
X=rl()
Xs = sorted(X)
Xsl = Xs[:N//2]
Xsr = Xs[N//2:]
r = Xsr[0]
l = Xsl[-1]
for x in X:
if x <= l:
print(r)
else:
print(l)
| p03379 |
def mid(n):
return int((n + 1) / 2)
N = int(eval(input()))
X = list(map(int, input().split()))
save = X[:]
for i in range(N):
X = save[:]
del X[i]
X.sort()
print((X[mid(N - 1) - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
save = X[:]
save.sort()
midL = save[int(N / 2 - 1)]
midR = save[int(N / 2)]
for i in X:
if i <= midL:
print(midR)
else:
print(midL)
| p03379 |
N=int(input())
L=list(map(int,input().split()))
[print(sorted(L[:i]+L[i+1:])[N//2-1]) for i in range(N)]
| N=int(eval(input()))
L=list(map(int,input().split()))
LL=sorted(L)
M1=LL[N//2-1]
M2=LL[N//2]
for i in L:
if i>=M2:
print(M1)
else:
print(M2)
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
for i in range(n):
z=x.pop(i)
y=sorted(x)
print((y[n//2-1]))
x.insert(i,z)
| n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
l=y[n//2-1]
r=y[n//2]
for a in x:
print((l if a >= r else r))
| p03379 |
from statistics import median
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
print((median(X[:i]+X[i+1:]))) | N = int(eval(input()))
X = list(map(int, input().split()))
tmpls = sorted(X)
low = tmpls[N//2 -1]
high = tmpls[N//2]
for i in X:
if i > low:
print(low)
else:
print(high) | p03379 |
from collections import deque
N=int(eval(input()))
X=list(map(int,input().split()))
for i in range(N):
d=deque(X)
d.remove(X[i])
d=list(d)
d.sort()
print((d[N//2-1])) | N=int(eval(input()))
X=list(map(int,input().split()))
x=[]
for i in range(N):
x.append(X[i])
x.sort()
for i in range(N):
if X[i]<x[N//2]:
print((x[N//2]))
else:
print((x[N//2-1])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
def med(a):
b = sorted(a)
num = int((len(b)+1)/2)
return b[num-1]
for i in range(n):
temp = x[:]
temp.remove(x[i])
print((med(temp))) | n = int(eval(input()))
x = list(map(int, input().split()))
a = len(x)
b = sorted(x)
fa = b[int((a/2)-1)]
se = b[int(a/2)]
for i in range(n):
if x[i] <= fa:
print(se)
else:
print(fa) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
m = (n+1)//2
med1 = sx[m - 1]
med2 = sx[m]
for _x in x:
if _x <= med1:
print(med2)
else:
print(med1) | n = int(eval(input()))
x = list(map(int, input().split()))
x_ = sorted(x)
c = x_[n//2 - 1]
c_ = x_[n//2]
for i in range(n):
if x[i] <= c:
print(c_)
else:
print(c) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
for i in range(n):
x1=x[:i]
x2=x[i+1:]
x1.extend(x2)
x1.sort()
print((x1[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 |
n = int(eval(input()))
nums = list(map(int,input().split()))
for i in range(len(nums)):
tmp_nums = sorted(nums[:i]+nums[i+1:])
print((tmp_nums[len(tmp_nums)//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 range(n):
if x[i] <= a:
print(b)
else:
print(a) | p03379 |
def main():
N = int(eval(input()))
X = [int(i) for i in input().split()]
sorted_X = sorted(X)
median_1 = sorted_X[int(N/2)-1]
median_2 = sorted_X[int(N/2)]
for i in range(N):
remove_num = X[i]
if(sorted_X.index(remove_num) > (N/2 - 1)):
print(median_1)
else:
print(median_2)
if __name__=="__main__":
main() | def main():
N = int(eval(input()))
X = [int(i) for i in input().split()]
sorted_X = sorted(X)
median_1 = sorted_X[int(N/2)-1]
median_2 = sorted_X[int(N/2)]
for i in range(N):
remove_num = X[i]
if(remove_num > median_1):
print(median_1)
else:
print(median_2)
if __name__=="__main__":
main() | p03379 |
n = (int)(eval(input()))
l = (list)(list(map(int, input().split())))
sorted_l = sorted(l)
for i in range(n):
tmp = sorted_l.copy()
tmp.remove(l[i])
med = tmp[(n-1)//2]
print(med)
| n = (int)(eval(input()))
l = (list)(list(map(int, input().split())))
tmp = l.copy()
tmp.sort()
left = tmp[n//2-1]
right = tmp[n//2]
for item in l:
if item <= left:
print(right)
else:
print(left)
| p03379 |
N = int(eval(input()))
A = list(map(int, input().split()))
from statistics import median
for i in range(len(A)):
tmp = A.pop(0)
print((median(A)))
A.append(tmp) | N = int(eval(input()))
X = list(map(int,input().split()))
copy_X = X.copy()
X.sort()
for i in copy_X:
if(i<X[N//2]):
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 range(len(Y)):
if X[i] < Y[int(N / 2)]:
print((Y[int(N / 2)] ))
else:
print((Y[int(N / 2 - 1)])) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = X.copy()
Y.sort()
for i in range(len(Y)):
if X[i] < Y[int(N / 2)]:
print((Y[int(N / 2)] ))
else:
print((Y[int(N / 2) - 1])) | p03379 |
n = int(eval(input()))
arr = list(map(int,input().split()))
for i in range(n):
tarr = list(arr)
tarr.remove(tarr[i])
tarr.sort()
print((tarr[(len(tarr) + 1) // 2 - 1])) | n = int(eval(input()))
arr = list(map(int,input().split()))
tarr = list(arr)
tarr.sort()
num1 = tarr[len(tarr) // 2 - 1]
num2 = tarr[len(tarr) // 2]
for i in range(n):
if arr[i] < num2:
print(num2)
else:
print(num1) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
temp = 0
for i in range(N):
temp = X[i]
X[i] = 0
print((sorted(X)[int(N/2)]))
X[i] = temp | N = int(eval(input()))
X = list(map(int, input().split()))
Xs = sorted(X)
for i in range(N):
if X[i] < Xs[int(N/2)]:
print((Xs[int(N/2)]))
else:
print((Xs[int(N/2)-1])) | p03379 |
def main():
import sys
n=int(sys.stdin.readline())
m=(n-1)//2+2
x=tuple(map(int,input().split()))
x = (0,) + x + (0,)
for i in range(n):
print((sorted(x[:i+1]+x[i+2:])[m]))
if __name__ == '__main__':
main() | # ABC094C - Many Medians (ARC095C)
def main():
n = int(eval(input()))
x = list(map(int, input().split()))
# 偶数個の数から一つ数を取り除いたものの中央値はl,hのいずれか.
l, h = sorted(x)[n // 2 - 1 : n // 2 + 1]
ans = [h if e <= l else l for e in x] # l以下の値を取り除いたならば中央値はh
print(("\n".join(map(str, ans))))
if __name__ == "__main__":
main() | p03379 |
N=int(eval(input()))
X_raw=list(map(int,input().split()))
for i in range(N):
X=X_raw[:]
# X.pop(i)
del X[i]
X.sort()
print((X[int(N/2-1)]))
| N=int(eval(input()))
X=list(map(int,input().split()))
sX=sorted(X)
for i in X:
if i<=sX[int(N/2-1)]:
print((sX[int(N/2)]))
else:
print((sX[int(N/2-1)]))
| p03379 |
import statistics
N=int(eval(input()))
Xs=list(map(int, input().split()))
for i in range(len(Xs)):
Xs_i=Xs[:i]+Xs[i+1:]
med=statistics.median(Xs_i)
print(med) | N=int(eval(input()))
Xs=list(map(int, input().split()))
nXs=sorted(Xs)
medL=nXs[len(nXs)//2-1]
medR=nXs[len(nXs)//2]
if medL == medR:
for i in range(N):
print(medL)
else:
for i in Xs:
if i<=medL:
print(medR)
else:
print(medL) | p03379 |
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def median(l):
l = sorted(l)
if len(l) % 2 == 1:
return l[len(l) // 2]
else:
return (l[len(l)//2] + l[(len(l)//2)-1])//2
def main():
N = int(input().strip())
X_list = [int(i) for i in input().strip().split()]
num = 0
for i in range(N):
if i < N-1:
print((median(X_list[:i]+X_list[i+1:])))
else:
print((median(X_list[:i])))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = int(input().strip())
X_list = [int(i) for i in input().strip().split()]
sorted_x = sorted(X_list)
left = sorted_x[(N // 2)-1]
right = sorted_x[N // 2]
for x in X_list:
if x <= left:
print(right)
else:
print(left)
if __name__ == "__main__":
main()
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
c = (n - 1) // 2
for i in range(len(x)):
x2 = x.copy()
x2.pop(i)
x2.sort()
print((x2[c]))
| n = int(eval(input()))
x = list(map(int, input().split()))
x2 = x.copy()
x2.sort()
c1 = x2[n // 2 - 1]
c2 = x2[n // 2]
for i in x:
if(c1 >= i):
print(c2)
else:
print(c1)
| p03379 |
n = int(eval(input()))
X = list(map(int,input().split()))
h = int(n/2)
for i in range(n):
xis = []
if i != 0:
xis += X[0:i]
xis += X[i+1:n]
print((sorted(xis)[h-1]))
else:
xis = X[1:]
print((sorted(xis)[h-1])) | n = int(eval(input()))
X = list(map(int,input().split()))
h = int(n/2)
Xs = sorted(X)
m1 = Xs[h-1]
m2 = Xs[h]
for i in range(n):
if X[i] <= m1:
print(m2)
else:
print(m1) | p03379 |
N = int(eval(input()))
X = tuple(map(int, input().split()))
for i in range(N):
Y = list(X)
del Y[i]
Y.sort()
print((Y[N//2-1]))
| N = int(eval(input()))
X = tuple(map(int, input().split()))
Y = list(X)
Y.sort()
greater_median = Y[N//2]
smaller_median = Y[N//2-1]
average = (greater_median + smaller_median)/2
for x in X:
if x <= average:
print(greater_median)
else:
print(smaller_median) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
a = sorted(x)
mid_n = len(a)//2
for i in range(n):
if a.index(x[i]) < mid_n:
print((a[mid_n]))
else:
print((a[mid_n-1])) | n = int(eval(input()))
x = list(map(int, input().split()))
a = sorted(x)
mid_n = len(a)//2
right = a[mid_n]
left = a[mid_n-1]
for i in range(n):
if right > x[i]:
print(right)
else:
print(left) | p03379 |
def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = [int(input()) for i in range(n)]
#a = list(map(int, input().split()))
#a = [list(map(int, input().split())) for i in range(n)]
#a = [int(s) - 1 for s in input().split()]
#l=[int(input()) for _ in range(int(input()))]
#res = 0
n = int(eval(input()))
x = list(map(int, input().split()))
x2 = sorted(x)
med = x2[(n+1)//2-1]
for i in range(n):
x3 = sorted(x[:i] + x[i+1:])
print((x3[n//2-1]))
if __name__ == '__main__':
main()
| def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = [int(input()) for i in range(n)]
#a = list(map(int, input().split()))
#a = [list(map(int, input().split())) for i in range(n)]
#a = [int(s) - 1 for s in input().split()]
#l=[int(input()) for _ in range(int(input()))]
#res = 0
n = int(eval(input()))
x = list(map(int, input().split()))
x2 = sorted(x)
med1 = x2[n//2-1]
med2 = x2[n//2]
for i in x:
if i <= med1:
print(med2)
else:
print(med1)
if __name__ == '__main__':
main()
| p03379 |
def get_values():
return [int(a) for a in input().split()]
N, = get_values()
Xs = get_values()
for idx, xi in enumerate(Xs):
Ys = sorted(Xs[:idx] + Xs[idx+1:])
print((Ys[len(Ys) // 2])) | def get_values():
return [int(a) for a in input().split()]
# PROBLEM C
N, = get_values()
Xs = get_values()
Ys = sorted(Xs)
mdx = len(Ys) // 2
x2b = {x:Ys[mdx if idx < mdx else mdx - 1] for idx, x in enumerate(Ys)}
for x in Xs:
print((x2b[x])) | p03379 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list([int(x)-1 for x in stdin.readline().split()])
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
#A
def A():
return
#B
def B():
return
#C
def C():
n = II()
x = LI()
for i in range(n):
xb = x[::1]
del xb[i]
xb.sort()
print((xb[n//2-1]))
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#Solve
if __name__ == '__main__':
C()
| #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list([int(x)-1 for x in stdin.readline().split()])
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
#A
def A():
return
#B
def B():
return
#C
def C():
n = II()
x = LI()
xb = x[::1]
xb.sort()
a = xb[n // 2 - 1]
b = xb[n // 2]
for i in range(n):
if x[i] <= a:
print(b)
elif x[i] >= b:
print(a)
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#Solve
if __name__ == '__main__':
C()
| p03379 |
N = int(eval(input()))
x_list = [i for i in map(int, input().split())]
for i, x in enumerate(x_list):
tmp = x_list.copy()
tmp.pop(i)
tmp.sort()
print((tmp[(len(tmp))//2])) | N = int(eval(input()))
x_list = [i for i in list(map(int, input().split()))]
tmp = x_list.copy()
x_list.sort()
big = x_list[len(x_list)//2]
small = x_list[len(x_list)//2-1]
for x in tmp:
if x >= big:
print(small)
else:
print(big)
| p03379 |
import statistics
from collections import deque
d = deque()
a = int(eval(input()))
d = list(map(int, input().split()))
#print(d)
for i in range(a):
b = d.pop(0)
print((statistics.median(d)))
d.append(b)
# print(d) | import copy
a = int(eval(input()))
l = list(map(int, input().split()))
l2 = sorted(copy.deepcopy(l))
#print(l2)
for i in l:
if i < l2[a//2]:
print((l2[a//2]))
else:
print((l2[a//2 - 1]))
| p03379 |
import math
import statistics
import copy
N = int(eval(input()))
li = list(map(int, input().split()))
for i in range(N):
a = copy.copy(li)
a.pop(i)
print((statistics.median(a))) | n = int(eval(input()))
s = list(map(int, input().split()))
sx = sorted(s)
a = sx[(n//2)-1]
b = sx[n//2]
for i in s:
if i <= a:
print(b)
else:
print(a) | p03379 |
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
a2 = copy.copy(a)
a2.sort()
for i in range(n):
if a2.index(a[i]) <= n//2 - 1:
print((a2[n//2]))
else:
print((a2[n//2 - 1])) | import copy
n = int(eval(input()))
a = list(map(int, input().split()))
a2 = copy.copy(a)
a2.sort()
x = a2[n//2 - 1]
y = a2[n//2]
for i in a:
if i <= x:
print(y)
else:
print(x) | p03379 |
from operator import itemgetter
import collections
N = int(eval(input()))
X = list(map(int, input().split()))
d = {}
for x in X:
if x in d:
d[x] += 1
else:
d[x] = 1
keys = sorted(list(d.keys()), reverse = True)
for x in X:
idx = N//2
d[x] -= 1
for k in keys:
idx -= d[k]
if idx <= 0:
print(k)
break
d[x] += 1 | N = int(eval(input()))
X = list(map(int,input().split()))
SX = sorted(X)
m1,m2 = SX[N//2-1],SX[N//2]
for a in X:
print((m2 if a <= m1 else m1))
| p03379 |
n=int(eval(input()))
x = [int(i) for i in input().split()]
x = sorted([[x[i], i] for i in range(n)])
#print(x)
ans = [0]*n
#print(ans)
for i in range(n):
x_ = x[:i]+x[i+1:]
# print(x_)
ans[x[i][1]] = x_[n//2-1][0]
for i in range(n):
print((ans[i])) | n=int(eval(input()))
x = [int(i) for i in input().split()]
x = sorted([[x[i], i] for i in range(n)])
#print(x)
ans = [0]*n
for i in range(n):
if i < n//2:
ans[x[i][1]] = x[n//2][0]
else:
ans[x[i][1]] = x[n//2-1][0]
for i in range(n):
print((ans[i])) | p03379 |
#!/usr/bin/env python3
n = int(eval(input()))
x = list(map(int,input().split()))
a = sorted(x)
base = a[n//2]
for i in range(n):
#if x[i] > a[n//2-1] or (x[i] == a[n//2-1] and a.count(x[i]) > 1): print(a[n//2-1])
if x[i] > a[n//2-1]: print((a[n//2-1]))
else: print((a[n//2])) | #!/usr/bin/env python3
n = int(eval(input()))
x = list(map(int,input().split()))
a = sorted(x)
for j in x:
if j <= a[n//2-1]: print((a[n//2]))
else: print((a[n//2-1])) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
t=x
for i in range(n):
x=x[:i]+x[i+1:]
x.sort()
#print(x)
print((x[(n-1)//2]))
x=t
| n=int(eval(input()))
x=list(map(int,input().split()))
t=sorted(x)
m=n//2
a=t[m-1];b=t[m]
#print(a,b)
for i in range(n):
if x[i]<=a:
print(b)
else:
print(a)
| p03379 |
import copy
n = int(eval(input()))
x = list(map(int, input().split()))
soredx = sorted(x)
for i in range(n):
temp = copy.deepcopy(soredx)
temp.remove(x[i])
print((temp[int(n/2-1)]))
| n = int(eval(input()))
x = list(map(int, input().split()))
soredx = sorted(x)
migi = soredx[int(n/2-1)]
hidari = soredx[int(n/2)]
for i in range(n):
if(migi<x[i]):
print(migi)
else:
print(hidari)
| p03379 |
import bisect
N = int(eval(input()))
X = list(map(int, input().split()))
A = []
for i in range(N):
bisect.insort(A, X[i])
leftB = A[N//2 - 1]
rightB = A[N//2]
for i in range(N):
if X[i] <= leftB:
print(rightB)
else:
print(leftB)
| N = int(eval(input()))
X = list(map(int, input().split()))
A = sorted(X)
leftB = A[N//2 - 1]
rightB = A[N//2]
for i in range(N):
if X[i] <= leftB:
print(rightB)
else:
print(leftB)
| p03379 |
N=int(eval(input()))
X=[int(i) for i in input().split()]
for i in range(N):
x=X.copy()
del x[i]
x.sort()
print((x[N//2-1]))
| N=int(eval(input()))
X=[int(i) for i in input().split()]
x=X.copy()
x.sort()
mina=x[N//2-1]
minb=x[N//2]
for i in range(N):
if mina<X[i]:
print(mina)
else :
print(minb)
| p03379 |
import copy
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
xx = copy.deepcopy(x)
xx.pop(i)
xx.sort()
print((xx[(len(xx) + 1) // 2 - 1])) | import copy
n = int(eval(input()))
x = list(map(int,input().split()))
xx= sorted(x)
L_x = xx[n//2 - 1]
R_x = xx[n//2]
for arr in x:
print((L_x if R_x <= arr else R_x)) | p03379 |
import copy
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
memo = copy.deepcopy(x)
memo.pop(i)
memo.sort()
print((memo[(n - 1) // 2])) | n = int(eval(input()))
x = list(map(int, input().split()))
xs = sorted(x)
for i in range(n):
if x[i] <= xs[n // 2 - 1]:
res = xs[n // 2]
else:
res = xs[n // 2 - 1]
print(res) | p03379 |
import sys
import bisect
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
X = list(map(int, input().split()))
X_s = sorted(X)
for i in range(n):
idx = bisect.bisect_left(X_s, X[i])
if idx <= n // 2 - 1:
print((X_s[n // 2]))
else:
print((X_s[n // 2 - 1]))
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
X = list(map(int, input().split()))
for i in range(n):
x = X[i]
X[i] = [i, x]
X_s = sorted(X, key=lambda x: x[1])
res = [0] * n
for i in range(n):
idx, _ = X_s[i]
if i < n // 2:
res[idx] = X_s[n // 2][1]
else:
res[idx] = X_s[n // 2 - 1][1]
print(*res, sep="\n")
if __name__ == '__main__':
resolve()
| p03379 |
N = int(eval(input()))
li = list(map(int,input().split()))
lia = li[:]
for i in range(N) :
del lia[i]
lia.sort()
ave = int((N-2)/2)
a = lia[ave]
lia = li[:]
print(a) | N = int(eval(input()))
li = list(map(int,input().split()))
lia = li[:]
lia.sort()
index1 = int(N/2)
index2 = int((N-2)/2)
ave1 = lia[index2]
ave2 = lia[index1]
for i in range(N) :
if li[i] <= ave1 :
print(ave2)
else :
print(ave1) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
mid = N // 2 - 1
for i in range(N):
tmp = X[:i]
tmp.extend(X[i+1:])
tmp.sort()
print((tmp[mid])) | N = int(eval(input()))
X = list(map(int, input().split()))
tmp = X[:]
tmp.sort()
mid = N // 2 - 1
low = tmp[mid]
high = tmp[mid + 1]
all = sum(tmp)
for a in X:
if a <= low:
print(high)
else:
print(low) | p03379 |
from statistics import median
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
Xx = [X[k] for k in range(N) if k != i]
print((median(Xx)))
| N = int(eval(input()))
X = list(map(int, input().split()))
Xs = sorted(X)
median1 = Xs[int(N/2)-1]
median2 = Xs[int(N/2)]
for i in range(N):
if X[i] >= median2:
print(median1)
else:
print(median2) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
sort_X = sorted(X)
for i in range(N):
copy_X = sort_X.copy()
copy_X.remove(X[i])
print((copy_X[(N-1)//2])) | N = int(eval(input()))
X = list(map(int, input().split()))
sort_X = sorted(X)
a = sort_X[N//2-1]
b = sort_X[N//2]
for i in range(N):
if X[i] < b:
print(b)
else:
print(a) | p03379 |
import statistics
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(len(X)):
print((statistics.median(X[:i]+X[i+1:]))) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = X[:]
Y = sorted(Y)
med1 = Y[N // 2 - 1]
med2 = Y[N // 2]
for x in X:
if x < med2:
print(med2)
else:
print(med1) | p03379 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
y = [[x[i], i] for i in range(n)]
y.sort()
z = [0 for i in range(n)]
for i in range(n):
z[y[i][1]] = (y[:i]+y[i+1:])[(n+1)//2-1][0]
for i in range(n):
print((z[i])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
y = sorted(x)
med1 = y[n//2-1]
med2 = y[n//2]
for i in range(n):
if x[i] <= med1:
print(med2)
else:
print(med1) | p03379 |
N = int(eval(input()))
X = [int(_) for _ in input().split()]
X2 = sorted(X)
r = X2[N // 2 ]
l = X2[N // 2 -1]
for i in range(N):
if X2.index(X[i]) < N // 2:
print(r)
else:
print(l) | N = int(eval(input()))
X = [int(_) for _ in input().split()]
X2 = sorted(X)
r = X2[N // 2 ]
l = X2[N // 2 -1]
for i in range(N):
if X[i] < r:
print(r)
else:
print(l) | p03379 |
import copy
n = int(eval(input()))
x = list(map(int,input().split()))
base = copy.deepcopy(x)
base_1 = copy.deepcopy(x)
base.sort()
base_1.sort()
for i in range(n):
a_l = base.index(x[i])
a_u = base_1.index(x[i])
if a_l == (n-1)-a_u:
if n//2 > a_l:
ans = base[n//2]
elif n//2 <= a_l:
ans = base[n//2-1]
else:
if (a_l <= n//2-1) and (n//2 <= a_u):
ans = base[a_l]
elif a_u <= n//2 - 1:
ans = base[n//2]
elif n//2 <= a_l:
ans = base[n//2 - 1]
print(ans) | import copy
n = int(eval(input()))
x = list(map(int,input().split()))
key = {}
base = copy.deepcopy(x)
base.sort()
for i in range(n):
if n//2 > i:
ans = base[n//2]
elif n//2 <= i:
ans = base[n//2-1]
if not ("key" + str(base[i]) in key):
key["key" + str(base[i])] = ans
for i in range(n):
print((key["key" + str(x[i])])) | p03379 |
import statistics
n = int(eval(input()))
x = [int(_) for _ in input().split()]
m1 = statistics.median_low(x)
m2 = statistics.median_high(x)
for i in range(n):
if x[i] <= m1:
print(m2)
else:
print(m1)
| n = int(eval(input()))
x = [int(_) for _ in 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 |
'''
Created on 2020/08/29
@author: harurun
'''
def main():
import copy
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
X=list(map(int,pin().split()))
t=(N+1)//2
Y=sorted(X)
for i in range(N):
T=copy.copy(Y)
T.remove(X[i])
print((T[t-1]))
return
main() | '''
Created on 2020/08/29
@author: harurun
'''
def main():
import copy
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
X=list(map(int,pin().split()))
t=(N+1)//2
Y=sorted(X)
ans1=Y[t-1]
ans2=Y[t]
median=ans1+ans2
for i in range(N):
s=X[i]
if s==ans1:
print(ans2)
elif s==ans2:
print(ans1)
elif 2*s<median:
print(ans2)
elif 2*s>median:
print(ans1)
return
main() | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
t=x[:i]+x[i+1:]
t.sort()
print((t[(n-1)//2])) | n = int(eval(input()))
x = list(map(int, input().split()))
t=sorted(x)
right=t[n//2]
left=t[n//2-1]
for i in x:
if i <= left:
print(right)
elif i >= right:
print(left) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
Xc = X.copy()
Xc.sort()
for i in range(N):
ind = Xc.index(X[i])
if ind < (N // 2):
print((Xc[N // 2]))
else:
print((Xc[N // 2 - 1])) | N = int(eval(input()))
X = list(map(int, input().split()))
Xc = X.copy()
Xc.sort()
Xcmed = Xc[N//2]
for i in range(N):
if X[i] < Xcmed:
print((Xc[N // 2]))
else:
print((Xc[N // 2 - 1]))
| p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
Xc = X.copy()
Xc.sort()
Xcmed = Xc[N//2]
for i in range(N):
if X[i] < Xcmed:
print((Xc[N // 2]))
else:
print((Xc[N // 2 - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
Xc = X.copy()
Xc.sort()
d = N // 2
dn = Xc[d]
for i in range(N):
if X[i] < dn:
print((Xc[d]))
else:
print((Xc[d-1]))
| p03379 |
from statistics import median
N = int(eval(input()))
data = list(map(int, input().split(' ')))
for i in range(len(data)):
temp = [x for j,x in enumerate(data) if j != i]
print((median(temp))) | N = int(eval(input()))
data = list(map(int, input().split(' ')))
sorteddata = sorted(data)
c1 = sorteddata[N // 2]
c2 = sorteddata[N // 2 - 1]
for i in range(N):
if (data[i] < c1):
print(c1)
else:
print(c2) | p03379 |
n=int(eval(input()))
arr=[int(x) for x in input().split()]
for i in range(n):
a = arr[:i] + arr[i+1:]
a.sort()
index = int((n-1)/2)
print((a[index]))
| n=int(eval(input()))
arr=[int(x) for x in input().split()]
sorted_arr = sorted(arr)
l = sorted_arr[n//2 -1]
r = sorted_arr[n//2]
for x in arr:
if x >= r:
print(l)
else:
print(r)
| p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
sortedX = sorted(X)
for x in X:
if sortedX.index(x) <= N//2 -1:
print((sortedX[N//2]))
else:
print((sortedX[N//2 -1])) | N = int(eval(input()))
X = list(map(int,input().split()))
sortedX = sorted(X)
for x in X:
if sortedX[N//2 -1] >= x:
print((sortedX[N//2]))
else:
print((sortedX[N//2 -1])) | p03379 |
def resolve():
n=int(eval(input()))
x=list(map(int,input().split()))
for i in x:
s=sorted(x)
s.remove(i)
print((s[(n-2)//2]))
resolve() | def resolve():
n=int(eval(input()))
x=list(map(int,input().split()))
s=sorted(x)
m=s[(n-2)//2]
for i in x:
ans=s[(n-2)//2+1] if i<=m else m
print(ans)
resolve() | p03379 |
N = int( eval(input()))
Xs = list(map(int, input().split()))
for i,x in enumerate(Xs):
arr = Xs[:i] + Xs[i+1:]
arr.sort(reverse=True)
m = int(N/2)-1
print((arr[m])) | N = int(eval(input()))
Xs = list(map(int, input().split()))
s = sorted(Xs)
a = s[N//2-1]
b = s[N//2]
for x in Xs:
if x < b:
print(b)
else :
print(a) | p03379 |
if __name__ == '__main__':
N = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X[:])
for i in range(N):
_x = x[:]
_x.remove(X[i])
print((_x[int(N/2-1)]))
| if __name__ == '__main__':
N = int(eval(input()))
X = list(map(int, input().split()))
x = sorted(X[:])
min_median = x[int(N/2-1)]
max_median = x[int(N/2)]
for i in range(N):
if X[i] <= min_median:
print(max_median)
else:
print(min_median)
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
l=len(x)
xs=sorted(x)
m=xs[l//2-1]
M=xs[l//2]
for i in range(l):
print((m if x[i]>m else M)) | n=int(eval(input()))
x=list(map(int,input().split()))
l=len(x)
s=sorted(x)
m=s[l//2-1]
M=s[l//2]
for i in range(l):
print((m if x[i]>m else M)) | p03379 |
n = int(eval(input()))
A = list(map(int, input().split()))
for i in range(n):
B = A[:i] + A[i+1:]
B = sorted(B)
print((B[(n)//2-1])) | n = int(eval(input()))
A = list(map(int, input().split()))
B = sorted(A)
median_a = B[n//2 - 1]
median_b = B[n//2]
# print(median_a, median_b)
for i in A:
if i <= median_a:
print(median_b)
else:
print(median_a) | p03379 |
import math
n = int(eval(input()))
X = list(map(int,input().split()))
x = sorted(X)
left = x[math.floor((n-1)/2)]
right = x[math.ceil((n-1)/2)]
for a in X:
i = x.index(a)
if i < (n-1)/2:
print(right)
else:
print(left) | import math
n = int(eval(input()))
X = list(map(int,input().split()))
x = sorted(X)
left = x[math.floor((n-1)/2)]
right = x[math.ceil((n-1)/2)]
for a in X:
if a < right:
print(right)
else:
print(left) | p03379 |
N = int(eval(input()))
X = [int(i) for i in input().split()]
for i in range(N):
x = [int(X[j]) for j in range(N) if i != j]
x.sort()
print((x[(N - 1) // 2]))
| N = int(eval(input()))
X = [int(i) for i in input().split()]
x = sorted(X)
n = N // 2
for i in range(N):
if X[i] < x[n]:
print((x[n]))
else:
print((x[n - 1])) | p03379 |
N = int(eval(input()))
n = (N//2) - 1
X = list(map(int,input().split()))
import copy
for i in range(N):
Y = copy.deepcopy(X)
Y.pop(i)
Y.sort()
ans = Y[n]
print(ans) | N = int(eval(input()))
n = (N//2) - 1
X = list(map(int,input().split()))
import copy
Y = copy.deepcopy(X)
Y.sort()
a = Y[n]
b = Y[n+1]
for i in range(N):
ans = a
if X[i] <= a:
ans = b
print(ans)
| p03379 |
import copy
n = int(eval(input()))
l = list(map(int,input().split()))
p = n//2
for i in range(n):
tmp = copy.copy(l)
tmp[i] = 0
tmp.sort()
print((tmp[p])) | import copy
n = int(eval(input()))
l = list(map(int,input().split()))
p1 = n//2
p2 = n//2-1
ans = copy.copy(l)
ans.sort()
for i in l:
if i >= ans[p1]:
print((ans[p2]))
else:
print((ans[p1]))
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
for i in range(n):
if x[i] <= x_sorted[n // 2 - 1]:
print((x_sorted[n // 2]))
else:
print((x_sorted[n // 2 - 1])) | n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
mL = (n - 1) // 2
mR = mL + 1
anss = []
for i in range(n):
if x[i] <= x_sorted[mL]:
anss.append(x_sorted[mR])
else:
anss.append(x_sorted[mL])
for ans in anss:
print(ans) | p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
Median_i=N//2-1
for i in range(N):
X_=X[:]
del X_[i]
X_.sort()
print((X_[Median_i])) | N=int(eval(input()))
X=list(map(int,input().split()))
Median_1_i=N//2-1
Median_2_i=N//2
X_=X[:]
X_.sort(reverse=True)
Median_1=X_[Median_1_i]
Median_2=X_[Median_2_i]
for x in X:
if x<Median_1:
print(Median_1)
else:
print(Median_2) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
xn=y[n//2-1]
xnp=y[n//2]
for i in range(n):
if x[i]>xn:
print(xn)
else:
print(xnp) |
n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
n2=n//2
y1=y[n2-1]
y2=y[n2]
for i in range(n):
if x[i]<=y1:
print(y2)
else:
print(y1)
| p03379 |
n=int(eval(input()))
x=list([int(x) for x in input().split()])
mi = int(n/2)-1
sx=x[:]
sx.sort()
for item in x:
cx=sx[:]
cx.remove(item)
print((cx[mi])) | n=int(eval(input()))
x=list([int(x) for x in input().split()])
mi = n//2 - 1
sx=sorted(x)
for item in x:
if item > sx[mi]:
print((sx[mi]))
else:
print((sx[mi+1]))
| p03379 |
n = int(eval(input()))
xlist = [int(x) for x in input().split()]
sxlist = sorted(xlist)
for i in range(n):
if sxlist.index(xlist[i]) < n/2:
print((sxlist[int(n/2)]))
else:
print((sxlist[int(n/2)-1])) | n = int(eval(input()))
xlist = [int(x) for x in input().split()]
sxlist = sorted(xlist)
mid = sxlist[int(n/2)]
mid2 = sxlist[int(n/2)-1]
for i in range(n):
if xlist[i] < mid:
print(mid)
else:
print(mid2) | p03379 |
from statistics import median_low, median_high
n = int(eval(input()))
xs = list(map(int, input().split()))
m1, m2 = median_low(xs), median_high(xs)
medians = [m2 if x < m2 else m1 for x in xs]
print(('\n'.join(map(str, medians)))) | n = int(eval(input()))
xs = list(map(int, input().split()))
ys = list(sorted(xs))
m1 = ys[n//2 - 1]
m2 = ys[n//2]
medians = [m2 if x < m2 else m1 for x in xs]
print(('\n'.join(map(str, medians)))) | p03379 |
N = int(eval(input()))
x = list(map(int, input().split()))
for i in range(N):
X = sorted(x[:i] + x[i+1:])
print((X[(N-1)//2]))
| N = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
a = sx[N//2-1]
b = sx[N//2]
for c in x:
if c <= a:
print(b)
else:
print(a) | p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
s=[]
for i in range(N):
s=sorted(X[:i]+X[i+1:])
print((s[N//2-1])) | N=int(eval(input()))
X=list(map(int,input().split()))
S=sorted(X)
b=S[N//2]
a=S[(N//2)-1]
for i in X:
print((b if i<b else a)) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split(" ")))
x_sorted = sorted(x)
samples = (x_sorted[n//2], x_sorted[n//2-1])
for x_i in x:
print((samples[x_sorted.index(x_i)//(n//2)])) | n = int(eval(input()))
x = list(map(int, input().split(" ")))
x_sorted = sorted(x)
for x_i in x:
print(((x_sorted[n//2-1], x_sorted[n//2])[x_i < x_sorted[n//2]])) | p03379 |
N = int(eval(input()))
numbers_r = tuple(map(int, input().split(' ')))
numbers_s = sorted(numbers_r)
med_high = numbers_s[N // 2]
med_low = numbers_s[N // 2 - 1]
for number in numbers_r:
if number == med_low:
print(med_high)
elif number == med_high:
print(med_low)
elif number < med_low:
print(med_high)
elif number > med_high:
print(med_low)
| N = int(eval(input()))
numbers_r = tuple(map(int, input().split(' ')))
numbers_s = sorted(numbers_r)
med_high = numbers_s[N // 2]
med_low = numbers_s[N // 2 - 1]
for number in numbers_r:
if number <= med_low:
print(med_high)
else:
print(med_low)
| p03379 |
import copy
N = int(eval(input()))
X = [int(i) for i in input().split()]
Y = copy.deepcopy(X)
Y.sort()
ML, MH = Y[N//2 - 1], Y[N//2]
for i in range(N):
if X[i] >= MH:
print(ML)
else:
print(MH) | import sys
def solve():
input = sys.stdin.readline
N = int(input())
X = [int(x) for x in input().split()]
Xsub = sorted(X)
midl, midr = Xsub[(N - 1) // 2], Xsub[N // 2]
ans = [0] * N
for i, x in enumerate(X):
if x <= midl: ans[i] = midr
else: ans[i] = midl
print(*ans, sep="\n")
return 0
if __name__ == "__main__":
solve()
| p03379 |
import copy
n=int(eval(input()))
x=list(map(int,input().split()))
for i in range(n):
y=copy.copy(x)
del y[i]
y.sort()
print((y[n//2-1]))
| n=int(eval(input()))
x=list(map(int,input().split()))
y=x.copy()
y.sort()
cr=y[n//2]
cl=y[n//2-1]
for i in range(n):
if x[i]<=cl:
print(cr)
elif x[i]>=cr:
print(cl)
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
def median(x, i):
x = sorted(x)
return(x[i])
def algo(x):
l = len(x)
t = (l + 1) // 2
while True:
p = x[len(x) // 2]
a = []
b = []
for i in x:
if i <= p:
a.append(i)
else:
b.append(i)
if len(a) == 0:
return median(b, t - 1)
elif len(b) == 0:
return median(a, t - 1)
elif len(a) >= t:
x = a
else:
x = b
t = t - len(a)
for i in range(n):
a = x.pop(i)
print((algo(x)))
x.insert(i, a) | n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
for i in x:
if i < y[len(y) // 2]:
print((y[len(y) // 2]))
else:
print((y[len(y) // 2 - 1])) | 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.sort()
print((y[n//2-1]))
| n = int(eval(input()))
x = [int(i) for i in input().split()]
y = sorted(x)
a , b = y[n//2-1], y[n//2]
for i in x:
if i > a:
print(a)
else:
print(b) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
c = N // 2
x = sorted(X)
for v in X:
if x.index(v) < c:
print((x[c]))
else:
print((x[c - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
c = N // 2
x = sorted(X)
for v in X:
if v < x[c]:
print((x[c]))
else:
print((x[c - 1]))
| p03379 |
n = int(eval(input()))
X = [int(i) for i in input().split()]
sX = sorted(X)
r,l = sX[n//2],sX[n//2-1]
if r != l:
for x in X:
if x<=l: print(r)
else: print(l)
else:
for _ in range(n): print(l)
| n = int(eval(input()))
X = [int(i) for i in input().split()]
sX = sorted(X)
r,l = sX[n//2],sX[n//2-1]
for x in X:
if x<=l: print(r)
else: print(l)
| p03379 |
n=int(eval(input()))
x=[int(i) for i in input().split()]
for i in range(n):
A=x[0:i]+x[i+1:]
A.sort()
half=n//2
print((A[n-half-1])) | n=int(eval(input()))
x=[int(i) for i in input().split()]
A=sorted(x)
b=A[n//2-1]
c=A[n//2]
for i in x:
if i<=b:
print(c)
else:
print(b) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
Y = [[X[k],k] for k in range(N)]
Z = Y.copy()
Z.sort()
A = [0 for k in range(N)]
for k in range(N):
A[Z[k][1]] = (Z[:Y[k][1]]+Z[Y[k][1]+1:])[N//2-1][0]
for x in A:
print(x) | N = int(eval(input()))
X = list(map(int, input().split()))
Y = [[X[k],k] for k in range(N)]
Y.sort()
A = [0 for k in range(N)]
for k in range(N):
if k >= N//2:
A[Y[k][1]] = Y[N//2-1][0]
else:
A[Y[k][1]] = Y[N//2][0]
for x in A:
print(x) | p03379 |
from statistics import mean,median
n=int(eval(input()))
a=[int(i) for i in input().split()]
med=median(a)
a1=[i for i in a if i <= med]
a2=[i for i in a if i >= med]
#print(a1)
#print(a2)
for i in range(n):
if a[i]<min(a2):
print((min(a2)))
else:
print((max(a1)))
#if a[0] < median(a)
| n=int(eval(input()))
a=[int(i) for i in input().split()]
b=sorted(a)
for i in range(n):
if a[i]<=b[int(n/2)-1]:
print((b[int(n/2)]))
else:
print((b[int(n/2)-1]))
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
for i in range(n):
xi = x[:i]+x[i+1:]
xi.sort()
print((xi[n//2-1]))
| n=int(eval(input()))
x=list(map(int,input().split()))
sort_x = sorted(x)
for i in range(n):
if x[i]<=sort_x[n//2-1]:
print((sort_x[n//2]))
else:
print((sort_x[n//2-1]))
| p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
for i in range(N):
X_list=X[:i]+X[i+1:]
X_list.sort()
print((X_list[int(N/2-1)])) | N=int(eval(input()))
X=list(map(int,input().split()))
Y=X.copy()
Y.sort()
for i in range(N):
if X[i]<Y[int(N/2)]:
print((Y[int(N/2)]))
else:
print((Y[int(N/2)-1])) | p03379 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
l=b[:n//2]
u=b[n//2:]
for i in a:
if i <= l[-1]:
print((u[0]))
else:
print((l[-1])) | n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
c=b[n//2-1]
d=b[n//2]
if c==d:
for i in range(n):print(c)
else:
for i in range(n):
if a[i]<=c:print(d)
else:print(c)
| p03379 |
N=int(eval(input()))
*X,=list(map(int,input().split()))
import statistics
for i in range(len(X)):
t=X[:i]+X[i+1:]
print((statistics.median(t))) | N=int(eval(input()))
*X,=list(map(int,input().split()))
s=sorted(X)
t1=s[N//2-1]
t2=s[N//2]
for x in X:
if x<=t1:
print(t2)
else:
print(t1) | p03379 |
import copy
import statistics
n = int(eval(input()))
x = list(map(int,input().split()))
l = ((len(x))//2)
for i in range(n):
l2 = copy.copy(x)
l2.pop(i)
l2.sort()
print((l2[l-1])) | import copy
n = int(eval(input()))
x = list(map(int,input().split()))
x2 = copy.copy(x)
x2.sort()
num1,num2 = (len(x)//2)-1,(len(x)//2)
med1,med2 = x2[num1],x2[num2]
for i in range(n):
if x[i] <= med1:
print(med2)
else:
print(med1) | p03379 |
#094
n=int(eval(input()))
x=list(map(int,input().split()))
x.insert(0,0) #x[0]に0を挿入
sorted_x = sorted(x[:])
for i in range(1,n+1):
idx = sorted_x.index(x[i])
print((sorted_x[n//2+1] if idx<=n//2 else sorted_x[n//2])) | n=int(eval(input()))
x=list(map(int,input().split()))
x.insert(0,0) #x[0]に0を挿入
sorted_x = sorted(x[:])
l,r=sorted_x[n//2],sorted_x[n//2+1]
for i in range(1,n+1):
print((r if x[i]<=l else l)) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
x.insert(0,0) #x[0]に0を挿入
sorted_x = sorted(x[:])
l,r=sorted_x[n//2],sorted_x[n//2+1]
for i in range(1,n+1):
print((r if x[i]<=l else l)) | n = int(eval(input()))
a = list(map(int, input().split()))
sorted_a = sorted(a)
# 中央値を求める
med = [sorted_a[n // 2 - 1], sorted_a[n // 2]]
for i in range(n):
if a[i] <= med[0]:
print((med[1]))
else:
print((med[0])) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
sx = sorted(X)
lm = sx[N//2-1]
rm = sx[N // 2]
for i in range(N):
if sx.index(X[i]) <= N//2 -1:
print(rm)
else:
print(lm)
| N = int(eval(input()))
X = list(map(int, input().split()))
sx = sorted(X)
lm = sx[N//2-1]
rm = sx[N // 2]
for i in range(N):
if X[i] <= lm:
print(rm)
else:
print(lm)
| p03379 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
X = il()
S = sorted(X)
for x in X:
idx = S.index(x)
if idx < N // 2:
print((S[N // 2]))
else:
print((S[N // 2 - 1]))
if __name__ == '__main__':
main()
| import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
X = il()
S = sorted(X)
l = S[N // 2 - 1]
r = S[N // 2]
for x in X:
if x <= l:
print(r)
else:
print(l)
if __name__ == '__main__':
main()
| p03379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.