제출 #100609

#제출 시각아이디문제언어결과실행 시간메모리
100609dalgerokSličice (COCI19_slicice)C++17
90 / 90
61 ms1476 KiB
#include<bits/stdc++.h>
using namespace std;



const int N = 505;



int n, m, k, p[N], b[N], dp[N][N];


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        cin >> p[i];
    }
    for(int i = 0; i <= m; i++){
        cin >> b[i];
    }
    memset(dp, -1, sizeof(dp));
    dp[0][0] = 0;
    for(int i = 1; i <= n; i++){
        for(int s = 0; s <= k; s++){
            for(int j = 0; s - j >= 0; j++){
                dp[i][s] = max(dp[i][s], dp[i - 1][s - j] + b[p[i] + j]);
            }
        }
    }
    cout << dp[n][k];
}
#Verdict Execution timeMemoryGrader output
Fetching results...