Submission #3635364

Source Code Expand

N = int(input())
A = [int(a) for a in input().split()]
A.sort()
mid = A[-1]/2
Aj = A[0]
for i in range(1, N-1):
    if abs(A[i] - mid) < abs(Aj - mid):
        Aj = A[i]
print(A[-1], Aj)

Submission Info

Submission Time
Task D - Binomial Coefficients
User earlgrey_yh
Language Python (3.4.3)
Score 400
Code Size 194 Byte
Status AC
Exec Time 132 ms
Memory 14060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 17
Set Name Test Cases
Sample sample1.txt, sample2.txt
All even0.txt, even1.txt, float.txt, odd0.txt, odd1.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, rnd_5.txt, rnd_6.txt, rnd_7.txt, rnd_8.txt, rnd_9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
even0.txt AC 132 ms 13660 KB
even1.txt AC 127 ms 13660 KB
float.txt AC 126 ms 14060 KB
odd0.txt AC 131 ms 13660 KB
odd1.txt AC 130 ms 13660 KB
rnd_0.txt AC 114 ms 13100 KB
rnd_1.txt AC 105 ms 12132 KB
rnd_2.txt AC 113 ms 12760 KB
rnd_3.txt AC 105 ms 12060 KB
rnd_4.txt AC 93 ms 10860 KB
rnd_5.txt AC 125 ms 13972 KB
rnd_6.txt AC 102 ms 11768 KB
rnd_7.txt AC 101 ms 11444 KB
rnd_8.txt AC 114 ms 12648 KB
rnd_9.txt AC 108 ms 12476 KB
sample1.txt AC 17 ms 3060 KB
sample2.txt AC 17 ms 3060 KB