퇴사

p. 377

 

n=int(input())
t=[]
p=[]
dp=[0]*(n+1)
max_value=0

for i in range(n):
  _t,_p=map(int, input().split())
  t.append(_t)
  p.append(_p)

for i in range(n-1,-1,-1):
  day=i+t[i]
  if day<=n:
    dp[i]=max(max_value, p[i]+dp[day])
    max_value=dp[i]

  else:
    dp[i]=max_value

print(max_value)