C++ 14501 퇴사

#include<iostream>
#include <string>
#include <vector>
#include<algorithm>
using namespace std;
int main()
{
    
    int n; cin >> n;
    vector<pair<int, int>> aa(18);
    vector<int> dp(n + 20,0);
    for (int i = 1; i <= n; i++)
    {
        cin >> aa[i].first >> aa[i].second;
    }
    int result = 0;
    for (int i = n; i >= 1; i--)
    {
        if (aa[i].first + i > n + 1)
            dp[i] = dp[i + 1];
        else
            dp[i] = max(dp[i + 1], aa[i].second + dp[i + aa[i].first]);
 
        result = max(result, dp[i]);
    }
    cout << result;
    return 0;
}
 

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

14501번: 퇴사