[백준 14501번] 퇴사

소스코드

---

#include <iostream>
using namespace std;
 
int n, a[2][16],num[16], Max=0;
 
void cal(int idx, int sum) {
    if (idx == n+1) {
        Max = (Max < sum ? sum : Max);
        return;
    }
    if (idx+1<=n+1)
        cal(idx + 1, sum);
    if (idx + a[0][idx] <= n+1)
        cal(idx + a[0][idx], sum + a[1][idx]);
}
 
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[0][i] >> a[1][i];
    cal(1, 0);
    cout << Max << '\n';
    return 0;
}