Submission #3225117


Source Code Expand

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

N = int(input())
MAX_a = 0
ans = 0
for i in range(N):
	a,b = inpl()
	if MAX_a < a:
		ans = a+b
		MAX_a = a

print(ans)

Submission Info

Submission Time
Task B - Different Distribution
User simamumu
Language Python (3.4.3)
Score 200
Code Size 396 Byte
Status AC
Exec Time 353 ms
Memory 4212 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 336 ms 4204 KB
02.txt AC 341 ms 4208 KB
03.txt AC 338 ms 4208 KB
04.txt AC 338 ms 4208 KB
05.txt AC 338 ms 4208 KB
06.txt AC 332 ms 4204 KB
07.txt AC 332 ms 4208 KB
08.txt AC 334 ms 4204 KB
09.txt AC 328 ms 4208 KB
10.txt AC 353 ms 4204 KB
11.txt AC 322 ms 4208 KB
12.txt AC 331 ms 4204 KB
13.txt AC 335 ms 4204 KB
14.txt AC 342 ms 4204 KB
15.txt AC 29 ms 4208 KB
16.txt AC 29 ms 4204 KB
17.txt AC 29 ms 4208 KB
18.txt AC 29 ms 4208 KB
19.txt AC 29 ms 4212 KB
20.txt AC 29 ms 4204 KB
s1.txt AC 29 ms 4208 KB
s2.txt AC 29 ms 4208 KB
s3.txt AC 29 ms 4204 KB