boj 5612

Spadework 2020. 2. 9. 15:05

* Solved 기준 브론즈3 단순 풀이

n,m,M = int(input()),int(input()),0
for _ in range(n):
	a,b = map(int, input().split())
	m = m+a-b
	if(m>M): M=m
	elif(m<0): M=0; break
print(M)