[Python] 백준 14501번 - 퇴사

n = int(input())
day = []
val = []
for _ in range(n):
  d, v = map(int, input().split())
  day.append(d)
  val.append(v)

dp = [0 for _ in range(n+1)]

for i in range(n-1, -1, -1):
  if day[i] + i > n :
    dp[i] = dp[i+1]
  else:
    dp[i] = max(dp[i+1], val[i] + dp[i + day[i]])

print(dp[0])