#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];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
1280 KB |
Output is correct |
2 |
Correct |
3 ms |
1280 KB |
Output is correct |
3 |
Correct |
60 ms |
1384 KB |
Output is correct |
4 |
Correct |
58 ms |
1280 KB |
Output is correct |
5 |
Correct |
59 ms |
1280 KB |
Output is correct |
6 |
Correct |
60 ms |
1280 KB |
Output is correct |
7 |
Correct |
57 ms |
1408 KB |
Output is correct |
8 |
Correct |
59 ms |
1388 KB |
Output is correct |
9 |
Correct |
60 ms |
1400 KB |
Output is correct |
10 |
Correct |
61 ms |
1476 KB |
Output is correct |