Submission #4033354

Source Code Expand

n=int(input())
p=[]
for i in range(n):
    a,b=map(int,input().split())
    p.append([b,a])
p.sort()
print(p[-1][1]+p[0][1]-p[-1][1]+p[0][0])

Submission Info

Submission Time
Task B - Different Distribution
User TKR18
Language Python (3.4.3)
Score 200
Code Size 147 Byte
Status AC
Exec Time 460 ms
Memory 20064 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 421 ms 20060 KB
02.txt AC 448 ms 20016 KB
03.txt AC 437 ms 20012 KB
04.txt AC 426 ms 20020 KB
05.txt AC 444 ms 20008 KB
06.txt AC 444 ms 20004 KB
07.txt AC 430 ms 20048 KB
08.txt AC 450 ms 20016 KB
09.txt AC 460 ms 20004 KB
10.txt AC 432 ms 20004 KB
11.txt AC 422 ms 20056 KB
12.txt AC 429 ms 20064 KB
13.txt AC 454 ms 20048 KB
14.txt AC 432 ms 20060 KB
15.txt AC 17 ms 2940 KB
16.txt AC 17 ms 2940 KB
17.txt AC 18 ms 3060 KB
18.txt AC 17 ms 2940 KB
19.txt AC 18 ms 3060 KB
20.txt AC 18 ms 3060 KB
s1.txt AC 18 ms 2940 KB
s2.txt AC 18 ms 3060 KB
s3.txt AC 17 ms 3060 KB