[BOJ 14501] 퇴사

출처 : https://www.acmicpc.net/problem/14501

#include <iostream>

#include <algorithm>

using namespace std;

int N, Result;

int T[17], P[17], dp[17];

int main()

{

cin >> N;

for (int i = 1; i <= N; i++)

{

cin >> T[i]; cin >> P[i];

}

for (int i = 1; i <= N; i++)

{

for (int j = i + T[i]; j <= N + 1; j++)

{

dp[j] = max(dp[i] + P[i], dp[j]);

}

}

cout << dp[N+1] << endl;

return 0;

}