#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
using namespace std;
const int N = 510;
int n, m, k, b[N], p[N], f[N][N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
cin >> p[i];
for (int i = 0; i <= m; i++)
cin >> b[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= k; j++)
f[i][j] = -1;
f[0][0] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j <= k; j++){
if (f[i][j] < 0) continue;
for (int z = 0; z + j <= k && z + p[i] <= m; z++)
f[i + 1][j + z] = max(f[i + 1][j + 1], f[i][j] + b[p[i] + z]);
}
cout << f[n][k];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
1280 KB |
Output isn't correct |
2 |
Incorrect |
5 ms |
1408 KB |
Output isn't correct |
3 |
Incorrect |
57 ms |
1408 KB |
Output isn't correct |
4 |
Incorrect |
57 ms |
1408 KB |
Output isn't correct |
5 |
Incorrect |
58 ms |
1532 KB |
Output isn't correct |
6 |
Incorrect |
57 ms |
1528 KB |
Output isn't correct |
7 |
Incorrect |
58 ms |
1280 KB |
Output isn't correct |
8 |
Incorrect |
59 ms |
1280 KB |
Output isn't correct |
9 |
Incorrect |
56 ms |
1408 KB |
Output isn't correct |
10 |
Incorrect |
59 ms |
1528 KB |
Output isn't correct |