[C++] 백준 BOJ 14501 퇴사

문제링크 : https://boj.kr/14501

// BOJ 14501 퇴사
#include <bits/stdc++.h>
 
using namespace std;
 
int max(int a, int b) {
    return a > b ? a : b;
}
 
int dp[17];
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("../input.txt", "r", stdin);
 
    int num, day, pay;
    cin >> num;
 
    for (int i = 1; i <= num; i++) {
        cin >> day >> pay;
        dp[i + 1] = max(dp[i], dp[i + 1]);
        if (i + day > num + 1)
            continue;
        dp[i + day] = max(dp[i + day], dp[i] + pay);
    }
    cout << dp[num + 1];
 
    return 0;
}