input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int,input().split()))
b = list(a)
c = int(n/2)
for j in range(1,c):
b.remove(max(b))
b.remove(min(b))
ML = min(b)
MR = max(b)
for i in range(0,n):
if a[i] >= MR:
print(ML)
else:
print(MR) | n = int(eval(input()))
a = list(map(int,input().split()))
b = list(a)
b.sort()
c = int(n/2)
ML=b[c-1]
MR=b[c]
for i in range(0,n):
if a[i] >= MR:
print(ML)
else:
print(MR) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
for i, num in enumerate(x):
x_copy = x.copy()
x_copy.pop(i)
x_copy = sorted(x_copy)
print((x_copy[len(x_copy) // 2])) | n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
target = x_sorted[n // 2 - 1]
for num in x:
if num <= target:
print((x_sorted[n // 2]))
else:
print((x_sorted[n // 2 - 1]))
| p03379 |
N = int(input())
X = list(map(int, input().split()))
mid1, mid2 = sorted(X)[N//2-1:N//2+1]
print(*[mid1 if xi>mid1 else mid2 for xi in X], sep="\n")
| N = int(eval(input()))
X = list(map(int, input().split()))
mid1, mid2 = sorted(X)[N//2-1:N//2+1]
print(('\n'.join(str(mid1) if xi>mid1 else str(mid2) for xi in X)))
| p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
mid1, mid2 = sorted(X)[N//2-1:N//2+1]
print(('\n'.join(str(mid1) if xi>mid1 else str(mid2) for xi in X)))
| N = int(eval(input()))
X = list(map(int, input().split()))
mid1, mid2 = sorted(X)[N//2-1:N//2+1]
smid1 = str(mid1)
smid2 = str(mid2)
print(('\n'.join(smid1 if xi>mid1 else smid2 for xi in X)))
| p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
A = sorted(X[:])
B = A[N//2-1]
for i in range(N):
if X[i]>B:
print(B)
else:
print((A[N//2])) | N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X[:])
Y1 = Y[N//2-1]
Y2 = Y[N//2]
for i in range(N):
if X[i]>Y1:
print(Y1)
else:
print(Y2) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X[:])
Y1 = Y[N//2-1]
Y2 = Y[N//2]
for i in range(N):
if X[i]>Y1:
print(Y1)
else:
print(Y2) | N = int(eval(input()))
X = list(map(int,input().split()))
X.insert(0,0)
A = sorted(X[:])
a = A[N//2]
b = A[N//2+1]
for i in range(1,N+1):
if X[i]>a:
print(a)
else:
print(b) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(N):
Xwithout = X[:i]+X[i+1:]
Xwithout.sort()
print((Xwithout[N//2-1])) | N = int(eval(input()))
X = list(map(int,input().split()))
mylist = sorted(X)
for i in range(N):
ans = mylist[N//2-1]
if X[i] > ans:
print(ans)
else:
print((mylist[N//2])) | p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
a,b,c=y[n//2-1],y[n//2],y[:n//2]
for i in x:
print((b if i in c else a)) | n=int(eval(input()))
x=list(map(int,input().split()))
y=sorted(x)
a,b=y[n//2-1],y[n//2]
for i in x:
print((b if i<=a else a)) | p03379 |
def read_input():
n = int(eval(input()))
xlist = list(map(int, input().split()))
return n, xlist
def get_median(s):
l = len(s)
return s[int((l-1)/2)]
def submit():
n, xlist = read_input()
xlist = [(x, i) for i, x in enumerate(xlist)]
xlist.sort(key=lambda x: x[0])
pos_dic = {}
for i, x in enumerate(xlist):
pos_dic[x[1]] = i
for i in range(n):
target = pos_dic[i]
p = xlist.pop(target)
print((get_median(xlist)[0]))
xlist.insert(target, p)
if __name__ == '__main__':
submit()
|
def read_input():
n = int(eval(input()))
xlist = list(map(int, input().split()))
return n, xlist
def get_median(s, ignore):
l = len(s)
if ignore < l/2:
return s[int((l+1)/2)]
else:
return s[int((l-1)/2)]
def submit():
n, xlist = read_input()
xlist = [(x, i) for i, x in enumerate(xlist)]
xlist.sort(key=lambda x: x[0])
pos_dic = {}
for i, x in enumerate(xlist):
pos_dic[x[1]] = i
for i in range(n):
target = pos_dic[i]
print((get_median(xlist, target)[0]))
if __name__ == '__main__':
submit()
| p03379 |
N = int(eval(input()))
xn = list(map(int,input().split()))
x0,x1 = sorted(xn)[N//2-1:N//2+1]
xm = (x0+x1)/2
for x in xn:
print((x1 if x < xm else x0))
| N = int(eval(input()))
xn = list(map(int,input().split()))
x0,x1 = sorted(xn)[N//2-1:N//2+1]
res = [x0 if x0 < x else x1 for x in xn]
print(('\n'.join(map(str,res))))
| p03379 |
import statistics
N = int(eval(input()))
X = list(map(int, input().split()))
B = []
for i in range(N):
X_sub = X[:i] + X[i+1:]
B.append(statistics.median(X_sub))
for i in range(N):
print((B[i])) | def calculate_median(lst):
lst.sort()
median_right = lst[int(len(lst)/2)]
median_left = lst[int(len(lst)/2)-1]
return median_right, median_left
N = int(eval(input()))
X = list(map(int, input().split()))
X_copy = X.copy()
median_right, median_left = calculate_median(X)
for i in range(N):
if X_copy[i] >= median_right:
print(median_left)
elif X_copy[i] < median_right:
print(median_right) | p03379 |
from statistics import median
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
x = X[:]
del x[i]
print((median(x))) | from statistics import median
N = int(eval(input()))
X = list(map(int, input().split()))
medi_X = median(X)
sort_X = sorted(X)
for x in X:
if x < medi_X:
print((sort_X[int((N + 1) / 2)]))
else:
print((sort_X[int(((N + 1) / 2) - 1)])) | p03379 |
import statistics
import math
N=int(eval(input()))
X=list(map(int,input().split()))
for i in range(N):
l=X[:i]+X[i+1:]
med=statistics.median(l)
print(med) | N=int(eval(input()))
X=[int(x) for x in input().split()]
XX=sorted(X)
L=XX[N//2-1]
R=XX[N//2]
for x in X:
print((L if x>=R else R)) | p03379 |
import copy
N = int(eval(input()))
numList = list(map(int, input().split()))
medIndex = int((N-1)/2)
for i in range(0,N):
numListCopy = copy.deepcopy(numList)
numListCopy.pop(i)
numListCopy = sorted(numListCopy)
print((numListCopy[medIndex])) | import copy
N = int(eval(input()))
numList = list(map(int, input().split()))
numListCopy = copy.deepcopy(numList)
numList = sorted(numList)
medIndex = int((N)/2)
med1 = numList[medIndex-1]
med2 = numList[medIndex]
for i in range(0,N):
if numListCopy[i] <= med1:
print(med2)
elif med2 <= numListCopy[i]:
print(med1) | p03379 |
n = int(eval(input()))
X = list(map(int,input().split()))
medIndex = int((n-1)/2)
Z = sorted(X[:])
c1 = Z[int(n/2-1)]
c2 = Z[int(n/2)]
for i in range(n) :
if (X[i] <= c1) :
print(c2)
else :
print(c1)
| N = int(eval(input()))
A = list(map(int, input().split()))
AA = sorted(A)
X = AA[N//2 - 1]
Y = AA[N//2]
for i in range(N):
if A[i] < Y:
print(Y)
if A[i] >= Y:
print(X) | p03379 |
import copy
def center(lst):
lst.sort()
value = lst[(len(lst) - 1) // 2]
return value
def main():
n = int(eval(input()))
x_lst = list(map(int, input().split()))
ans_lst = []
for i in range(n):
lst = copy.deepcopy(x_lst)
del lst[i]
ans_lst.append(center(lst))
for i in range(n):
print((ans_lst[i]))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
x_lst = list(map(int, input().split()))
x_sorted_lst = sorted(x_lst)
median1 = x_sorted_lst[n // 2 - 1]
median2 = x_sorted_lst[n // 2]
if median1 == median2:
lst = [median1] * n
else:
lst = []
for i in range(n):
x = x_lst[i]
if x <= median1:
lst.append(median2)
elif median2 <= x:
lst.append(median1)
for i in range(n):
print((lst[i]))
if __name__ == '__main__':
main() | p03379 |
n = int(eval(input()))
lst = [int(i) for i in input().split()]
for i in range(n):
local_lst = lst[:i] + lst[i+1:]
lst_sort = sorted(local_lst)
print((lst_sort[n//2-1])) | n = int(eval(input()))
lst = [int(i) for i in input().split()]
lst_sort = sorted(lst)
med = (lst_sort[n//2] + lst_sort[n//2-1])/2
for i in range(n):
if lst[i] < med:
print((lst_sort[n//2]))
else:
print((lst_sort[n//2-1])) | p03379 |
N = int(input())
X = sorted([[x,i] for i, x in enumerate(map(int,input().split()))])
med1,med2 = X[(N-1)//2][0], X[(N-1)//2+1][0]
ans = []
for idx1, x in enumerate(X):
if idx1 <= (N-1)//2: ans.append([x[1],med2])
else: ans.append([x[1],med1])
#print(i)
[print(med) for i, med in sorted(ans)]
| N = int(eval(input()))
X = list(map(int, input().split()))
sorted_X = sorted(X)
med_options = [sorted_X[N//2-1], sorted_X[N//2]]
for i in range(N):
if X[i] <= med_options[0]:
print((med_options[1]))
elif med_options[1] <= X[i]:
print((med_options[0]))
| p03379 |
n = int(eval(input()))
x = [[i,int(item)] for i,item in enumerate(input().split())]
x.sort(key= lambda x:x[1])
for i in range(n):
ans = x[n//2][1] if i < n//2 else x[n//2-1][1]
x[i].append(ans)
x.sort(key= lambda x:x[0])
for i in range(n):
print((x[i][2])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
nx = sorted(x)
a = nx[n//2]
b = nx[n//2-1]
for i in range(n):
ans = a if x[i] < a else b
print(ans)
| p03379 |
n = int(eval(input()))
xm = list(map(int, input().split()))
xm_sort = sorted(xm)
a = n//2-1
for i in range(n):
if xm[i]<=xm_sort[a]:
print((xm_sort[a+1]))
else:
print((xm_sort[a])) | n = int(eval(input()))
x = list(map(int, input().split()))
x_sort = sorted(x)
index = int(n/2)
num = x_sort[index]
for i in range(n):
if x[i] < num:
print((x_sort[index]))
else:
print((x_sort[index-1])) | p03379 |
def main():
n=int(eval(input()))
x = [int(i) for i in input().split()]
x = tuple(x)
for i in range(n):
x_l=list(x)
del x_l[i]
x_l.sort()
print((x_l[int((len(x_l)-1)/2)]))
main() | def main():
n=int(eval(input()))
x = [int(i) for i in input().split()]
x_t = tuple(x)
x.sort()
l = x[int((len(x)/2 - 1))]
u = x[int((len(x)/2))]
for i in range(len(x_t)):
if (x_t[i]<=l):
print(u)
else:
print(l)
main() | p03379 |
from statistics import median
n=int(eval(input()))
l=list(map(int,input().split()))
for i in range(n):
x=l[:]
x.pop(i)
print((median(x))) | from statistics import median, median_low, median_high
n=int(eval(input()))
l=list(map(int,input().split()))
m_l=median_low(l)
m_h=median_high(l)
for i in range(n):
if l[i] <= m_l:
print(m_h)
elif l[i] >= m_h:
print(m_l) | p03379 |
import statistics
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
L = X[:i] + X[i+1:]
print((statistics.median(L))) | N = int(eval(input()))
X = list(map(int, input().split()))
L = sorted(X)
left = L[N//2-1]
right = L[N//2]
for x in X:
if x <= left:
print(right)
else:
print(left) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
tmp = X[:i] + X[i + 1:]
tmp.sort()
print((tmp[N // 2 - 1])) | N = int(eval(input()))
X = list(map(int, input().split()))
tmp = X[:]
tmp.sort()
left, right = (tmp[N // 2 - 1], tmp[N // 2])
for i in range(N):
if X[i] > left:
print(left)
else:
print(right) | p03379 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from copy import deepcopy
n = int(readline())
x = list(map(int, readline().split()))
memo = sorted(x)
for xx in x:
dx = deepcopy(memo)
dx.remove(xx)
if n % 2 == 0:
print((dx[(n - 1) // 2]))
else:
print(((dx[(n - 1) // 2] + dx[(n - 1) // 2 - 1]) / 2))
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
x = list(map(int, readline().split()))
memo = sorted(x)
dx = memo[n // 2]
for xx in x:
print((memo[n // 2 - 1] if dx <= xx else dx))
| p03379 |
import copy
N=int(eval(input()))
X=list(map(int,input().split()))
l=copy.copy(X)
for i in range(N):
X.remove(l[i])
X.sort(reverse=True)
print((X[int((N-2)/2)]))
X.insert(i,l[i]) | N=int(eval(input()))
X=list(map(int,input().split()))
y=sorted(X,reverse=True)
for i in X:
if i<y[(N-2)//2]:
print((y[(N-2)//2]))
else:
print((y[N//2])) | p03379 |
import sys
input = sys.stdin.readline
n = int(input())
x = list(map(int, input().split()))
lists = []
ind = ((n-1) + 1) // 2
for i in range(n):
if i == 0:
ans = x[i + 1:]
ans.sort()
lists.append(ans[ind-1])
else:
ans = x[0:i] + x[i + 1:]
ans.sort()
lists.append(ans[ind - 1])
[print(x) for x in lists]
| n = int(eval(input()))
x = list(map(int,input().split()))
y = sorted(x)[n//2-1:n//2+1]
for i in x:print((y[i <= y[0]])) | p03379 |
def main():
n = int(eval(input()))
center = (n+1)//2
x_s = list(map(int,input().split()))
sorted_x_s = sorted(x_s)
for i in x_s:
if sorted_x_s.index(i) < center:
print((sorted_x_s[center]))
else:
print((sorted_x_s[center-1]))
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
center = (n+1)//2
x_s = list(map(int,input().split()))
sorted_x_s = sorted(x_s)
center_num = sorted_x_s[center]
for i in x_s:
if i < center_num:
print((sorted_x_s[center]))
else:
print((sorted_x_s[center-1]))
if __name__ == '__main__':
main()
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
cs = x_sorted[n // 2 - 1]
cb = x_sorted[n // 2]
for i, v in enumerate(x):
if v <= cs:
print(cb)
else:
print(cs) | n = int(eval(input()))
X = list(map(int, input().split()))
sort_x = sorted(X)
smaller = sort_x[n//2-1]
bigger = sort_x[n//2]
for x in X:
if x <= smaller:
print(bigger)
else:
print(smaller) | p03379 |
from statistics import median
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
x_median = x[0:i] + x[i+1:]
print((median(x_median))) | n = int(eval(input()))
x = list(map(int, input().split()))
xsort = sorted(x)
x1, x2 = xsort[n//2-1], xsort[n//2]
for i in range(n):
if x[i] <= x1:
print(x2)
else:
print(x1) | p03379 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = sorted(A)
l = B[N//2 -1]
r = B[N//2]
for a in A:
if a<=l:
print(r)
else:
print(l)
| N = int(eval(input()))
A = [int(x) for x in input().split()]
B = sorted(A)
l = B[N//2 -1]
r = B[N//2]
for a in A:
if a<r:
print(r)
else:
print(l)
| p03379 |
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0
n=int(eval(input()))
Y=list(map(int,input().split()))
X=sorted(Y)
X0=X[n//2-1]
X1=X[n//2]
for i in range(n):
if Y[i]<=X0:
print(X1)
else:
print(X0)
| #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
a = Y[n//2-1]
b = Y[n//2]
for xi in X:
if xi <= a:print(b)
else:
print(a) | p03379 |
n = int(eval(input()))
li = list(map(int,input().split()))
for i in range(n):
tmp = sorted(li[:i]+li[i+1:])
print((tmp[int(n/2)-1])) | n = int(eval(input()))
li = list(map(int,input().split()))
lis = sorted(li)
m = lis[int(n/2)-1]
M = lis[int(n/2)]
for i in range(n):
if li[i] <= m:
print(M)
else:
print(m) | p03379 |
N = int(input())
X = []
for i, x in enumerate(map(int, input().split())):
X.append((x, i))
X.sort()
Y = [0] * N
for j, (x, i) in enumerate(X):
Y[i] = j
mid = N / 2
l = X[N // 2 - 1][0]
r = X[N // 2][0]
ans = []
for j in Y:
if j < mid:
ans.append(r)
else:
ans.append(l)
print(*ans, sep='\n')
| N = int(eval(input()))
X = list(map(int, input().split()))
order = {}
for idx, x in enumerate(X):
order[idx] = x
X.sort()
m = N // 2
l = X[m - 1]
r = X[m]
for idx in range(N):
x = order[idx]
if x <= l:
print(r)
else:
print(l)
| p03379 |
N = int(eval(input()))
x = {}
ans = {}
y = []
k = 1
l = 1
for i in list(map(int,input().split())):
x[k] = i
y.append(i)
k += 1
y.sort()
m_1 = y[int(N/2)]
m_2 = y[int(N/2)-1]
for i,j in sorted(list(x.items()),key = lambda x: x[1]):
if (int(N/2) >= l):
ans[i] = m_1
l+=1
else:
ans[i] = m_2
l+=1
for i,j in sorted(ans.items()):
print(j) | N = int(eval(input()))
A = [int(i) for i in input().split()]
sortA = sorted(A)
for i in range(N):
if A[i] < sortA[N//2]:
print((sortA[N//2]))
else:
print((sortA[N//2 - 1])) | p03379 |
n,*x=list(map(int,open(0).read().split()))
y=sorted(x)
a,b=y[n//2],y[n//2-1]
for i in x:print((a*(i<=b)or b)) | n,*x=list(map(int,open(0).read().split()))
y=sorted(x)[n//2-1:n//2+1]
for i in x:print((y[i<=y[0]])) | p03379 |
# 入力
n = int(eval(input()))
org_nums = list(map(int, input().split()))
# ソートは一回だけして、取り去る順番を明確にしてから１つずつ取り去り計算を行いたい
sorted_nums = sorted(org_nums) # 入力数列のソート
sorted_index = sorted(list(range(len(org_nums))), key=lambda k: org_nums[k]) #ソートされたリストから取り去る順番がわかる
extract_index = sorted(list(range(len(sorted_index))), key=lambda k: sorted_index[k]) #ソートされたリストから取り出すインデックスを取り出す順に並べる
#print(sorted_index)
#print(extract_index)
for i in extract_index:
tmp = sorted_nums.copy()
tmp.pop(i)
print((tmp[(n-1)//2])) | # AC
# 入力
n = int(eval(input()))
org_nums = list(map(int, input().split()))
# ソートは一回だけして、取り去る順番を明確にしてから１つずつ取り去り計算を行いたい
sorted_nums = sorted(org_nums) # 入力数列のソート
sorted_index = sorted(list(range(len(org_nums))), key=lambda k: org_nums[k]) #ソートされたリストから取り去る順番がわかる
extract_index = sorted(list(range(len(sorted_index))), key=lambda k: sorted_index[k]) #ソートされたリストから取り出すインデックスを取り出す順に並べる
#print(extract_index)
for i in extract_index:
if i+1 <= n // 2:
print((sorted_nums[n//2]))
else:
print((sorted_nums[n//2-1])) | p03379 |
N = int(eval(input()))
X_list = list(map(int, input().split()))
idx_value = []
for idx, v in enumerate(X_list, 1):
idx_value.append((idx, v,))
i_list = [i for i in range(1, N + 1)]
idx_value_copy = idx_value.copy()
idx_value_copy.sort(key=lambda x: x[1])
li_list = []
for t in idx_value:
for idx, t_c in enumerate(idx_value_copy, 1):
if t_c[0] == t[0] and t_c[1] == t[1]:
li_list.append(idx)
break
median_idx = int(N / 2)
median_left = idx_value_copy[median_idx - 1][1]
median_right = idx_value_copy[median_idx][1]
for i in li_list:
if i <= median_idx:
print(median_right)
else:
print(median_left)
| N = int(eval(input()))
X_list = list(map(int, input().split()))
X_list_copy = X_list.copy()
X_list_copy.sort()
median_idx = int(N / 2)
left_num = X_list_copy[median_idx - 1]
right_num = X_list_copy[median_idx]
for x in X_list:
if x < right_num:
print(right_num)
else:
print(left_num)
| p03379 |
n = int(eval(input()))
li = list(map(int, input().split()))
mid = (len(li)//2)-1
for i in range(n):
temp = li[:i] + li[i+1:]
temp.sort()
print((temp[mid])) | n = int(eval(input()))
li = list(map(int, input().split()))
mid_id = (len(li)//2)
temp = li.copy()
temp.sort()
mid1 = temp[mid_id-1]
mid2 = temp[mid_id]
for i in li:
if i <= mid1:
print(mid2)
else:
print(mid1) | p03379 |
def abc094C():
n = int(eval(input()))
x = input().split()
x = list(map(int, x))
y = x.copy()
y.sort()
nums = y[int(n / 2 - 1): int(n / 2 + 1)]
for i in range(n):
y = x.copy()
tf = nums[0] >= y[i]
del y[i]
y.sort()
print((nums[tf]))
abc094C() | def abc094C():
n = int(eval(input()))
x = input().split()
x = list(map(int, x))
y = x.copy()
y.sort()
nums = y[int(n / 2 - 1): int(n / 2 + 1)]
for i in range(n):
tf = nums[0] >= x[i]
print((nums[tf]))
abc094C() | p03379 |
import statistics
N = int(eval(input()))
L = list(map(int,input().split()))
for i in range(N):
Li = L[0:i] + L [i+1::]
k = statistics.median(Li)
print(k) | n = int(eval(input()))
a = list(map(int,input().split()))
b = tuple(a)
a.sort()
A1 = a[n//2-1]
A2 = a[n//2]
med = (A1+A2)/2
for i in range(n):
if b[i] <= med:
print(A2)
else:
print(A1)
| p03379 |
import statistics
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
ao = copy.copy(a)
for i in range(n):
a.pop(i)
print((statistics.median(a)))
a = copy.copy(ao)
| import statistics
n = int(eval(input()))
x = list(map(int, input().split()))
xmd = statistics.median(x)
xs = sorted(x)
for i in x:
if i < xmd:
print((xs[n // 2]))
else:
print((xs[n // 2 - 1]))
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
import statistics
for i in range(n):
y=x[i]
x.pop(i)
print((statistics.median(x)))
x.insert(i,y) | n = int(eval(input()))
x = list(map(int, input().split()))
lst = sorted(x)
small_med = lst[n // 2 - 1]
big_med = lst[n // 2]
for num in x:
if num > small_med:
print(small_med)
else:
print(big_med) | p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
tmp = [0] * N
for i in range(N):
tmp[i] = X[i]
tmp.sort()
mid_left = tmp[N // 2 - 1]
mid_right = tmp[N // 2]
for i in X:
if i <= mid_left:
print(mid_right)
else:
print(mid_left)
| N = int(eval(input()))
X = list(map(int, input().split()))
sort_x = sorted(X, key= lambda x: x)
mid_left = sort_x[N // 2 - 1]
mid_right = sort_x[N // 2]
for i in X:
if i <= mid_left:
print(mid_right)
else:
print(mid_left)
| p03379 |
n = int(eval(input()))
*l, = list(map(int, input().split()))
for i in range(n):
_l = l[:]
_l.pop(i)
_l.sort()
print((_l[(n-1)//2]))
| n = int(eval(input()))
*l, = list(map(int, input().split()))
p, q = sorted(l)[n//2-1 : n//2+1]
for _l in l:
print((p if _l >= q else q))
| p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
X_sort=sorted(X)
if X_sort[N//2-1]==X_sort[N//2]:
for n in range(N):
print((X_sort[N//2]))
else:
if X_sort.count(X_sort[N//2-1])==1:
for n in range(N):
if X[n]>X_sort[N//2-1]:
print((X_sort[N//2-1]))
else:
print((X_sort[N//2]))
else:
for n in range(N):
if X[n]>X_sort[N//2-1]:
print((X_sort[N//2-1]))
else:
print((X_sort[N//2]))
| N = int(eval(input()))
X = list(map(int,input().split()))
Xs = sorted(X)
Bl = Xs[(N-1)//2]
Br = Xs[N//2]
for i in range(N):
if Bl < X[i]:
print(Bl)
else:
print(Br)
| p03379 |
n = int(eval(input()))
X = list(map(int, input().split()))
X_sort = sorted(X)
mi = (n-1)//2
for i in range(n):
X_ = X_sort.copy()
X_.remove(X[i])
print((X_[mi])) | n = int(eval(input()))
X = list(map(int, input().split()))
X_sort = sorted(X)
xm1 = X_sort[n//2-1]
xm2 = X_sort[n//2]
xm = (xm1+xm2)/2
for i in range(n):
if X[i]<xm:
print(xm2)
else:
print(xm1) | p03379 |
N = int(eval(input()))
X = tuple(map(int,input().split()))
test = int(N/2)
for i in range(len(X)):
temp = list(X)
temp.pop(i)
temp = sorted(temp)
print((temp[test-1]))
| N = int(eval(input()))
X = list(map(int,input().split()))
X_sorted = sorted(X)
X_median = (N)/2
median1 = X_sorted[int(X_median)]
median2 = X_sorted[int(X_median-1)]
for i in range(N):
if X[i] >=median1:
print(median2)
else:
print(median1) | p03379 |
N,*X = list(map(int,open(0).read().split()))
chu = N//2
for i in range(N):
copy_X = X[:]
copy_X.sort()
copy_X.reverse()
copy_X.remove(X[i])
print((copy_X[chu - 1]))
| N,*X = list(map(int,open(0).read().split()))
chu = N//2 - 1
nums = sorted(X,reverse=True)
num, num_right = nums[chu], nums[chu + 1]
for x in X:
print((num if x < num else num_right)) | p03379 |
import statistics
N = int(eval(input()))
X = list(map(int,input().split()))
for n in range(N):
Y = X[:]
Y.pop(n)
print((statistics.median(Y))) | eval(input())
x=list(map(int,input().split()))
z=sorted(x)[(len(x))//2-1:]
for c in x:print((z[c<=z[0]])) | p03379 |
from statistics import *
N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
m = median(X)
for x in X:
if x<=m:
print((Y[N//2]))
else:
print((Y[N//2-1])) | N = int(eval(input()))
X = list(map(int,input().split()))
Y = sorted(X)
m1 = Y[N//2-1]
m2 = Y[N//2]
for x in X:
if x<m2:
print(m2)
else:
print(m1) | p03379 |
#-*-coding:utf-8-*-
def main():
N = int(eval(input()))
x_list = list(map(int, input().split()))
x_sort = x_list[:]
x_sort.sort()
med = (N // 2) -1
threshold = x_sort[med]
med_dict = {}
for i in range(N):
if x_list[i] in med_dict:
print((med_dict[x_list[i]]))
elif x_list[i] > threshold:
print(threshold)
else:
removed_x_list = x_list[:]
removed_x_list.remove(x_list[i])
removed_x_list.sort()
median = removed_x_list[med]
med_dict[x_list[i]] = median
print(median)
if __name__ == '__main__':
main() | #-*-coding:utf-8-*-
def main():
N = int(eval(input()))
x_list = list(map(int, input().split()))
x_list_sort = x_list[:]
x_list_sort.sort()
med1 = x_list_sort[(N//2)-1]
med2 = x_list_sort[N//2]
for i in x_list:
if i <= med1:
print(med2)
elif i >= med2:
print(med1)
if __name__ == '__main__':
main() | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
import copy
for i in range(N):
ls = copy.copy(X)
ls.pop(i)
sorted_ls = sorted(ls)
print((sorted_ls[((len(sorted_ls)+1)//2-1)])) | N = int(eval(input()))
X = list(map(int,input().split()))
sX = sorted(X)
small_median = sX[N//2-1]
large_median = sX[N//2]
for i in range(N):
if X[i] <= small_median:
print(large_median)
else:
print(small_median)
| p03379 |
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)) | N = int(input())
X = list(map(int,input().split()))
sx = list(sorted(X))
m1 = sx[N//2 - 1]
m2 = sx[N//2]
ans = []
for a in X:
if a >= m2:
ans.append(m1)
else:
ans.append(m2)
print(*ans, sep='\n')
| p03379 |
import statistics
N = int(eval(input()))
Xlist = list(map(int, input().split()))
for i in range(N):
a = Xlist[0:i] + Xlist[i + 1:]
print((statistics.median(a)))
| N = int(eval(input()))
Xlist = list(map(int, input().split()))
X_sort = sorted(Xlist)
left_med = X_sort[N//2-1]
right_med = X_sort[N//2]
for i in range(N):
if Xlist[i] <= left_med:
print(right_med)
else:
print(left_med)
| p03379 |
from copy import copy
N = int(eval(input()))
X = list(map(int, input().split()))
for xi in X:
Y = copy(X)
Y.remove(xi)
print((sorted(Y)[N // 2 - 1]))
| N = int(eval(input()))
X = list(map(int, input().split()))
M_small = sorted(X)[N // 2 - 1]
M_large = sorted(X)[N // 2]
for xi in X:
if xi <= M_small:
print(M_large)
else:
print(M_small)
| p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
x_sort = sorted(x[:])
for i in range(n):
x_sort_temp = x_sort[:]
x_sort_temp.remove(x[i])
#print("x_sort_removed",x_sort_temp)
print((x_sort_temp[(n-1)//2])) | n = int(eval(input()))
x = list(map(int,input().split()))
x_sort = sorted(x[:])
a,b = x_sort[n//2 - 1], x_sort[n//2]
for i in range(n):
if x[i] <= a:
print(b)
else:
print(a) | p03379 |
def medians(nums):
n = len(nums)
num_orig_pos = list(zip(nums, list(range(n))))
nums_sorted = sorted(num_orig_pos)
medians = []
med_left = nums_sorted[(n + 1)//2][0]
med_right = nums_sorted[(n + 1)//2 - 1][0]
for i in range((n + 1)//2):
medians.append((med_left, nums_sorted[i][1]))
for i in range((n + 1)//2, n):
medians.append((med_right, nums_sorted[i][1]))
return [x[0] for x in sorted(medians, key=lambda x: x[1])]
if __name__ == '__main__':
_ = eval(input())
nums = list(map(int, input().split()))
for i in medians(nums):
print(i) | def medians(nums, n):
median_left = nums[(n + 1)//2]
median_right = nums[(n + 1)//2 - 1]
return median_left, median_right
if __name__ == '__main__':
n = int(input())
nums = list(map(int, input().split()))
median_left, median_right = medians(sorted(nums), n)
for i in nums:
print(median_left) if i < median_left else print(median_right)
| p03379 |
import bisect
n = int(eval(input()))
x = list(map(int, input().split()))
m = (n-1) // 2
x_sorted = sorted(x)
ans = []
for i in range(n):
ind = bisect.bisect_left(x_sorted, x[i])
ans.append(x_sorted[0:ind] + x_sorted[ind+1:])
for i in range(n):
print((ans[i][m])) | n = int(eval(input()))
x = list(map(int, input().split()))
sorted_x = sorted(x)
l = sorted_x[n//2]
s = sorted_x[n//2-1]
for i in x:
if i <= s:
print(l)
else:
print(s) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
x_sorted = sorted(x)
l = x_sorted[n//2]
s = x_sorted[n//2-1]
for i in x:
print((l if i <= s else s)) | n = int(eval(input()))
x = list(map(int, input().split()))
sorted_x = sorted(x)
r = sorted_x[n//2]
l = sorted_x[n//2-1]
for n in x:
if n <= l:
print(r)
else:
print(l) | p03379 |
a = int(eval(input()))
x = list(map(int, input().split()))
k = list(x)
p = list(x)
for i in range(a):
del k[i]
#print(k)
k.sort()
#print(k)
if a%2==0:
print((k[a//2-1]))
else:
print(((k[a//2]+k[a//2-1])/2))
k = list(p)
| n = int(eval(input()))
x = list(map(int, input().split()))
y = list(x)
y.sort()
if n % 2 != 0:
a,b,c = y[n//2-1],y[n//2],y[n//2+1]
m = b
else:
a,b = y[n//2-1],y[n//2]
m = (a+b)/2
for i in range(n):
if i == n//2:
if n%2==0:
tm = a
else:
tm = (a+c)/2
if x[i] < m :
if n%2==0:
tm = b
else:
tm = (b+c)/2
else:
if n%2==0:
tm = a
else:
tm = (a+b)/2
print((int(tm)))
| p03379 |
N = int(eval(input()))
inputs = [int(i) for i in input().split()]
sorted_inputs = inputs[:]
sorted_inputs.sort()
left = sorted_inputs[N//2-1]
right = sorted_inputs[N//2]
for item in inputs:
index = sorted_inputs.index(item)
if index <= N // 2 - 1:
print(right)
else:
print(left)
| N = int(eval(input()))
inputs = [int(i) for i in input().split()]
sorted_inputs = inputs[:]
sorted_inputs.sort()
left = sorted_inputs[N//2-1]
right = sorted_inputs[N//2]
for item in inputs:
if item <= left:
print(right)
else:
print(left)
| p03379 |
import copy
input = open(0).read
N, *X = list(map(int, input().split()))
def main():
a = copy.copy(X)
l, r = sorted(a)[N // 2 - 1:N // 2 + 1]
print(('\n'.join([str(r) if x < r else str(l) for x in X])))
return
main()
| input = open(0).read
N, *X = list(map(int, input().split()))
def main():
l, r = sorted(X)[N // 2 - 1:N // 2 + 1]
print(('\n'.join([str(r) if x < r else str(l) for x in X])))
return
main()
| p03379 |
from bisect import bisect_left
N = int(eval(input()))
X = list(map(int,input().split()))
subX = X[1:]
subX.sort()
for i in range(N-1):
print((subX[N//2-1]))
k = bisect_left(subX,X[i])
subX.insert(k,X[i])
k = bisect_left(subX,X[i+1])
subX.pop(k)
print((subX[N//2-1]))
| from bisect import bisect_left
N = int(eval(input()))
X = list(map(int,input().split()))
Y = X.copy()
Y.sort()
for i in range(N):
k = bisect_left(Y,X[i])
if k < N//2:
print((Y[N//2]))
else:
print((Y[N//2-1])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
xx =list( x)
xx.pop(i)
xx=sorted(xx)
print((xx[(n-1)//2])) | n = int(eval(input()))
xx = list(map(int, input().split()))
x=sorted(xx)
for i in range(n):
if xx[i] < x[n //2]:
print((x[n // 2]))
else:
print((x[(n - 1) // 2])) | 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 = sorted(X)
m1= Y[N//2-1]
m2 = Y[N//2]
for i in range(N):
if X[i] <= m1:
print(m2)
else:
print(m1) | p03379 |
import copy
N = int(eval(input()))
X = list(map(int,input().split()))
length = len(X)
for i in range(N):
x = copy.copy(X)
x.pop(i)
x.sort()
print((x[int(length/2)-1]))
# print(x,X) | N = int(eval(input()))
X = list(map(int,input().split()))
sortx = sorted(X)
bef = sortx[N//2-1]
aft = sortx[N//2]
for i in X:
print((aft if i <= bef else bef))
| p03379 |
import copy
a = int(eval(input()))
da = list(map(int,input().split()))
k = a//2
for i in range(a):
n = copy.deepcopy(da)
del n[i]
n.sort()
print((n[k-1])) | n = int(eval(input()))
aa = list(map(int,input().split()))
a = [[] for i in range(n)]
for i in range(n):
a[i].append(aa[i])
a[i].append(i)
a.sort()
mm = a[n//2-1][0]
m = a[n//2][0]
for i in range(n):
a[i].append(i)
a.sort(key = lambda x:x[1])
for i in range(n):
if a[i][2] <= n//2 -1:
print(m)
else:
print(mm) | p03379 |
import statistics
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(1,N+1):
tmp = X[0:i-1]+X[i:]
print((statistics.median(tmp))) | N = int(eval(input()))
X = list(map(int,input().split()))
a = sorted(X)
b = a[N//2]
c = a[(N//2)-1]
for i in X:
print((b if i<b else c)) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
for i in range(n):
temp = sorted(x[:i] + x[i + 1:])
ans = temp[n // 2 - 1]
print(ans)
| n = int(eval(input()))
x = list(map(int, input().split()))
y = sorted(x)
mid1 = y[(n + 1) // 2]
mid2 = y[(n - 1) // 2]
for i in range(n):
if mid1 == mid2:
ans = mid1
elif x[i] >= mid1:
ans = mid2
elif x[i] <= mid2:
ans = mid1
print(ans)
| p03379 |
N = int(eval(input()))
x = list(int(i) for i in input().split())
for i in range(N):
a = x.pop(i)
print((sorted(x)[int(N/2-1)]))
x.insert(i,a)
| N = int(eval(input()))
A = list(map(int, input().split()))
X = []
for i, a in enumerate(A):
X.append([a, i])
X.sort()
# Biになり得るのはX[m-1] or X[m] (m=N//2)
m = N//2
itoj = {}
for j in range(N):
x, i = X[j]
itoj[i] = j
for i in range(N):
j = itoj[i]
if j < m:
print((X[m][0]))
else:
print((X[m-1][0])) | p03379 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
for i in range(n):
print((sorted((x[:i] + x[i+1:]))[(n-1)//2])) | n = int(eval(input()))
x = [int(i) for i in input().split()]
sorted_x = sorted(x)
smaller = sorted_x[n//2 - 1]
bigger = sorted_x[n//2]
for i in range(n):
print((bigger if x[i] <= smaller else smaller)) | p03379 |
import statistics
import math
import copy
n = int(eval(input()))
x = list(map(int,input().split()))
for i in range(n):
tmp = copy.copy(x)
tmp.pop(i)
print((statistics.median(tmp)))
|
n = int(eval(input()))
x = list(map(int,input().split()))
sort_x = sorted(x)
mid_1 = sort_x[n//2-1]
mid_2 = sort_x[n//2]
for i in range(n):
if x[i] <= mid_1:
print(mid_2)
else:
print(mid_1) | p03379 |
N=int(eval(input()))
X=list(map(int,input().split()))
list=sorted(X)
for i in X:
if list.index(i)<N/2:
print((list[N//2]))
else:
print((list[N//2-1])) | N=int(eval(input()))
X=list(map(int,input().split()))
list=sorted(X)
for i in range(N):
if list[int((N/2))]<=X[i]:
print((list[int(N/2)-1]))
else:
print((list[int(N/2)])) | p03379 |
N = int(eval(input()))
x = [i for i in map(int ,input().split())]
mid = (N-1) // 2
for i in range(N):
tmp = x[:]
tmp.remove(x[i])
tmp.sort()
print((tmp[mid])) | N = int(eval(input()))
x = [i for i in map(int ,input().split())]
mid = N // 2
tmp = x[:]
tmp.sort()
for i in range(N):
if tmp[mid] <= x[i]:
print((tmp[mid-1]))
else:
print((tmp[mid]))
| p03379 |
n=int(eval(input()))
x=list(map(int,input().split()))
a=sorted(x)
for i in x:
p=a.index(i)
if p< n//2:
print((a[n//2]))
else:
print((a[n//2-1]))
| n=int(eval(input()))
x=list(map(int,input().split()))
a=sorted(x)
ans={}
for i in range(n):
if i<n//2:
ans[a[i]]=a[n//2]
else:
ans[a[i]]=a[n//2-1]
for j in x:
print((ans[j]))
| p03379 |
import copy
from statistics import median
n = int(eval(input()))
x = list(map(int, input().split()))
y = copy.deepcopy(x)
for a in x:
y.remove(a)
print((median(y)))
y.append(a) | import copy
n = int(eval(input()))
x = list(map(int, input().split()))
if n == 2:
print((x[1]))
print((x[0]))
exit()
y = copy.deepcopy(x)
y.sort()
mid_s = y[n // 2 - 1]
mid_l = y[n // 2]
for a in x:
if a < mid_l:
print(mid_l)
else:
print(mid_s)
| p03379 |
N = int(eval(input()))
X = list(map(int, input().split()))
for i in range(N):
tmp = sorted(X[:i] + X[i+1:])[::-1]
print((tmp[(N-1)//2]))
| N = int(eval(input()))
X = list(map(int, input().split()))
Y = sorted(X)
a, b = Y[N//2], Y[N//2-1]
for i in range(N):
if X[i] < a:
print(a)
else:
print(b)
| p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
sortedx = x[:]
sortedx.sort()
for i in range(n):
ix = sortedx.index(x[i])
#print(sortedx)
#print(ix)
if ix < n/2:
print((sortedx[n//2]))
else:
print((sortedx[n//2-1])) | n = int(eval(input()))
x = list(map(int, input().split()))
sortedx = x[:]
sortedx.sort()
for i in range(n):
#ix = sortedx.index(x[i])
#print(sortedx)
#print(ix)
if x[i] <= sortedx[n//2-1]:
print((sortedx[n//2]))
else:
print((sortedx[n//2-1])) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
sortedx = x[:]
sortedx.sort()
for i in range(n):
#ix = sortedx.index(x[i])
#print(sortedx)
#print(ix)
if x[i] <= sortedx[n//2-1]:
print((sortedx[n//2]))
else:
print((sortedx[n//2-1])) | n = int(eval(input()))
x = list(map(int, input().split()))
sx = sorted(x)
xm = sx[n//2-1]
xp = sx[n//2]
for i in range(n):
if x[i] <= xm:
b = xp
else:
b = xm
print(b) | p03379 |
n = int(eval(input()))
x = list(map(int, input().split()))
ans = []
for i in range(n):
xx = x.copy()
delete = xx.pop(i)
xxx = sorted(xx)
print((xxx[(n-1)//2]))
| n = int(eval(input()))
x = list(map(int, input().split()))
xsort = sorted(x)
n1, n2 = xsort[n//2-1], xsort[n//2]
for i in range(n):
if x[i] <= n1:
print(n2)
else:
print(n1) | p03379 |
from collections import defaultdict
def main():
N = int(eval(input()))
X = [int(a) for a in input().split()]
X_s = sorted(X)
medi = defaultdict(int)
for i in range(len(X)):
if X[i] in list(medi.keys()):
print((medi[X[i]]))
else:
dummy = X_s[:]
dummy.remove(X[i])
m = dummy[len(dummy) // 2]
print(m)
medi[X[i]] = m
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
X = [int(a) for a in input().split()]
Xs = sorted(X)
for i in range(len(X)):
if Xs[len(Xs)//2] > X[i]:
print((Xs[len(Xs)//2]))
else:
print((Xs[len(Xs)//2 - 1]))
if __name__ == "__main__":
main() | p03379 |
def convert_X(x,index):
if index == 0:
return x[1:]
if index == len(x)-1:
return x[:-1]
return x[:index] + x[index+1:]
N = int(eval(input()))
X = [int(d) for d in input().split()]
for index in range(N):
d_x = convert_X(X,index)
d_x.sort()
print((d_x[int( (len(d_x)+1)/2 ) -1]))
| N = int(eval(input()))
X = [int(d) for d in input().split()]
sort_x = X.copy()
sort_x.sort()
nn = N//2
low_ = sort_x[nn-1]
high_ = sort_x[nn]
for x in X:
if x < high_:
print(high_)
else:
print(low_) | p03379 |
import statistics
import copy
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
l=copy.deepcopy(a)
l.pop(i)
l.sort()
ans=l[n//2-1]
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
l=sorted(a)
x=l[n//2-1]
y=l[n//2]
for z in a:
if z<=x:
print(y)
else:
print(x) | p03379 |
import sys
import copy
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N = INT()
A = MAP()
B = copy.deepcopy(A)
B.sort()
med = N//2
for i,a in enumerate(A):
if B.index(a)>=med:
print((B[med-1]))
else:
print((B[med])) | import sys
import copy
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N = INT()
A = MAP()
# print(A)
med = N//2
B = copy.deepcopy(A)
B.sort()
l_m = B[med-1]
h_m = B[med]
for a in A:
if a > l_m:
print(l_m)
else:
print(h_m) | p03379 |
n=int(eval(input()))
a=list(map(int,input().split()))
for i in range(n):
b=sorted(a[:i]+a[i+1:])
print((b[n//2-1])) | n=int(eval(input()))
a=list(map(int,input().split()))
b=sorted(a)
c=b[n//2]
d=b[n//2-1]
for i in range(n):
print((c if a[i]<=d else d)) | p03379 |
n=int(eval(input()))
*x,=list(map(int,input().split()))
s=sorted(x)
for i in x:
if s.index(i)<=(n//2)-1:
print((s[n//2]))
else:
print((s[(n//2)-1])) | n=int(eval(input()))
*x,=list(map(int,input().split()))
s=sorted(x)
m=(s[n//2]+s[(n//2)-1])/2
for i in x:
if i<m:
print((s[n//2]))
elif i==m:
print(i)
else:
print((s[(n//2)-1])) | p03379 |
import copy
n=int(eval(input()))
l=list(map(int,input().split()))
cl=copy.deepcopy(l)
l.sort()
for i in range(n):
tmp=cl[i]
l.remove(tmp)
print((l[n//2-1]))
l.append(tmp)
l.sort() | n=int(eval(input()))
l=list(map(int,input().split()))
list=sorted(l)
for i in range(n):
if l[i]<=list[n//2-1]:
print((list[n//2]))
else:
print((list[n//2-1])) | p03379 |
n = int(eval(input()))
x = list(map(int,input().split()))
for i,j in zip(x,list(range(n))):
x.remove(i)
t = sorted(x)
print((t[int(n/2-1)]))
x.insert(j,i) | n = int(eval(input()))
x = list(map(int,input().split()))
s = sorted(x)
u = s[int(n/2)]
t =s[int(n/2-1)]
for i in (x):
if i < u:
print(u)
else:
print(t) | p03379 |
from statistics import median
n = int(eval(input()))
a = list(map(int,input().split()))
for i in range(n):
b = a.copy()
b.remove(a[i])
c = median(b)
print(c) | n = int(eval(input()))
a = list(map(int,input().split()))
b = a.copy()
b.sort()
for i in range(n):
if a[i] < b[n//2]:
print((b[n//2]))
else:
print((b[(n//2)-1])) | p03379 |
if __name__ == "__main__":
n = int(eval(input()))
number_list = list(map(int,input().split()))
tmp_list = number_list[:]
tmp_list.sort()
for number in number_list:
i = tmp_list.index(number)
if i < (n/2):
print((tmp_list[int(n/2)]))
else :
print((tmp_list[int(n/2)-1]))
|
n = int(eval(input()))
number_list = list(map(int,input().split()))
tmp_list = sorted(number_list)
for number in number_list:
if number < tmp_list[n//2]:
print((tmp_list[n//2]))
else :
print((tmp_list[n//2-1]))
| p03379 |
def main():
N = int(eval(input()))
X = list(map(int, input().split(" ")))
nums = sorted(X)
center = len(nums)//2
if len(nums)%2 == 0:
is_even = True
else:
is_even = False
for x in X:
i = nums.index(x)
if i < center:
if is_even:
print((nums[center]))
else:
print((nums[center+1]))
else:
if is_even:
print((nums[center-1]))
else:
print((nums[center+1]))
if __name__ == '__main__':
main()
|
def main():
N = int(eval(input()))
X = list(map(int, input().split(" ")))
nums = sorted(X)
center = len(nums)//2
dic = {}
for i,x in enumerate(nums):
if x not in dic:
dic[x] = i
if len(nums)%2 == 0:
is_even = True
else:
is_even = False
for x in X:
i = dic[x]
if is_even:
if i < center:
print((nums[center]))
else:
print((nums[center-1]))
else:
print((nums[center+1]))
if __name__ == '__main__':
main()
| p03379 |
import statistics
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(N) :
x = X[0]
X.pop(0)
print((statistics.median(X)))
X.append(x)
| N = int(eval(input()))
X = list(map(int,input().split()))
Y = X.copy()
X = sorted(X)
bigger = X[N//2]
smaller = X[N//2-1]
for i in range(N) :
if Y[i] >= bigger :
print(smaller)
else :
print(bigger)
| p03379 |
def median(L) :
L = sorted(L)
return L[len(L)//2]
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(N) :
K = X[0:i] + X[(i+1):(N+1)]
print((median(K)))
| N = int(eval(input()))
X = list(map(int,input().split()))
L = sorted(X)
p = L[N//2-1]
q = L[N//2]
for i in range(N) :
if X[i] <= p :
print(q)
else :
print(p)
| p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
idx = N//2-1
for i in range(N):
tmp = X[:i] + X[i+1:]
tmp.sort()
print((tmp[idx])) | N = int(eval(input()))
X = list(map(int,input().split()))
mid = N//2-1
sX = sorted(X)
for i in range(N):
if X[i] <= sX[mid]: print((sX[mid+1]))
else: print((sX[mid])) | p03379 |
N = int(eval(input()))
X = [int(x) for x in input().split()]
X_nm = []
for n in range(N):
X_nm.append([n, X[n]])
X_nm.sort(key=lambda x:x[1])
for n in range(N):
idx = X_nm.index([n, X[n]])
if idx+1 <= N//2:
ans = X_nm[N//2][1]
print(ans)
else:
ans = X_nm[N//2-1][1]
print(ans) | N = int(eval(input()))
X = [int(x) for x in input().split()]
XX = list(tuple(X))
XX.sort()
X_medium_1 = XX[(N//2)-1]
X_medium_2 = XX[N//2]
for n in range(N):
if X[n] <= X_medium_1:
print(X_medium_2)
else: # X[n] >= X_medium_2:
print(X_medium_1) | p03379 |
N = int(eval(input()))
X = tuple(int(x) for x in input().split())
length = len(X)
for x in range(length):
print((sorted(X[:x]+X[x+1:])[length//2-1])) | N = int(eval(input()))
X = tuple(int(x) for x in input().split())
length = len(X)
med = sorted(X)[length//2-1:length//2+1]
for x in X:
print((med[1] if x < sum(med)/2 else med[0]))
| p03379 |
iN = int(eval(input()))
aX = [int(_) for _ in input().split()]
aXs = sorted(enumerate(aX),key=lambda x:x[1])
iMu = iN//2
iMd = iN//2 -1
iMuV = aXs[iMu][1]
iMdV = aXs[iMd][1]
if iMuV == iMdV:
print(("\n".join([str(iMuV)]*iN)))
else:
print(("\n".join(map(str,[iMuV if aX[x] < iMuV else iMdV for x in range(iN)]))))
| iN = int(eval(input()))
aX = [int(_) for _ in input().split()]
aXs = sorted(aX)
iMu = iN//2
iMd = iN//2 -1
iMuV = aXs[iMu]
iMdV = aXs[iMd]
if iMuV == iMdV:
print(("\n".join([str(iMuV)]*iN)))
else:
print(("\n".join(map(str,[iMuV if x < iMuV else iMdV for x in aX]))))
| p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
mid = []
for i in range(N):
s = X[:i]+X[i+1:]
s.sort()
mid.append(s[(N-1)//2])
for m in mid:
print(m) | N = int(eval(input()))
X = list(map(int,input().split()))
sort_X = sorted(X)
l, r = sort_X[N//2-1], sort_X[N//2]
for x in X:
if(x <= l):
print(r)
else:
print(l) | p03379 |
N = int(eval(input()))
X = list(map(int,input().split()))
sort_X = sorted(X)
l, r = sort_X[N//2-1], sort_X[N//2]
for x in X:
if(x <= l):
print(r)
else:
print(l) | N = int(eval(input()))
X = list(map(int,input().split()))
sort_X = sorted(X)
l = sort_X[N//2-1]
r = sort_X[N//2]
for x in X:
if(x <= l):
print(r)
else:
print(l) | p03379 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.