[준비운동 PART1. 튼튼한 기본기] 지능형 기차 2(2460번)

1. 문제설명

https://www.acmicpc.net/problem/2460

2. 나의 풀이

people = dict()
answer = 0
peopleBus = [0 for _ in range(10)]
for i in range(10):
    n, m = map(int, input().split())
    people[i] = [n, m]

for i in range(len(people)):
    peopleBus[i] = peopleBus[i-1] - people[i][0]
    peopleBus[i] += people[i][1]

answer = max(peopleBus)

print(answer)