Submission #3206816

Source Code Expand

n = int(input())
a = []
b = []
for i in range(n):
    aa,bb = map(int,input().split())
    a.append(aa)
    b.append(bb)

m = max(a)
n = b[a.index(m)]
print(m+n)

Submission Info

Submission Time
Task B - Different Distribution
User morio__
Language Python (3.4.3)
Score 200
Code Size 173 Byte
Status AC
Exec Time 318 ms
Memory 11056 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 23
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 316 ms 11044 KB
02.txt AC 294 ms 11044 KB
03.txt AC 298 ms 10960 KB
04.txt AC 315 ms 11020 KB
05.txt AC 301 ms 11044 KB
06.txt AC 308 ms 10964 KB
07.txt AC 318 ms 11044 KB
08.txt AC 298 ms 11048 KB
09.txt AC 292 ms 10964 KB
10.txt AC 290 ms 11052 KB
11.txt AC 303 ms 10996 KB
12.txt AC 298 ms 10976 KB
13.txt AC 291 ms 10972 KB
14.txt AC 299 ms 11056 KB
15.txt AC 17 ms 2940 KB
16.txt AC 17 ms 2940 KB
17.txt AC 17 ms 2940 KB
18.txt AC 17 ms 2940 KB
19.txt AC 17 ms 2940 KB
20.txt AC 17 ms 2940 KB
s1.txt AC 17 ms 2940 KB
s2.txt AC 17 ms 2940 KB
s3.txt AC 17 ms 3060 KB