Submission #9720789

Source Code Expand

N = int(input())
X = list(map(int,input().split()))

A = sorted(X)
f = N // 2 - 1
b = f + 1
C1 = A[f]
C2 = A[b]

for i in range(N):
  if X[i] <= C1:
    print(C2)
  elif X[i] >= C2:
    print(C1)

Submission Info

Submission Time
Task C - Many Medians
User otaku46
Language Python (3.4.3)
Score 300
Code Size 208 Byte
Status AC
Exec Time 321 ms
Memory 25556 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 17 ms 3060 KB
10.txt AC 296 ms 24604 KB
11.txt AC 238 ms 24056 KB
12.txt AC 170 ms 18720 KB
2.txt AC 159 ms 13672 KB
3.txt AC 289 ms 24432 KB
4.txt AC 283 ms 25556 KB
5.txt AC 310 ms 25220 KB
6.txt AC 288 ms 25024 KB
7.txt AC 224 ms 19444 KB
8.txt AC 282 ms 23824 KB
9.txt AC 321 ms 25152 KB
sample1.txt AC 17 ms 3060 KB
sample2.txt AC 17 ms 3060 KB
sample3.txt AC 17 ms 3060 KB