| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 148232 | 洛谷号:1021020 | 训练赛 | C++ | Compile Error | 0 | 0 MS | 0 KB | 356 | 2024-05-22 21:21:22 |
#include <bits/stdc++.h> using namespace std; int dp[101][101]; int n, V, M; int main() { cin >> V >> M >> n; for(int i = 1; i<=n; i++) { int v, m, w; cin >> w >> v >> m; for(int j = V; j>=v; j--) { for(int k = M; k>=m; k--) { f[j][k]=max(f[j][k], f[j-v][k-m]+w); } } } cout << f[V][M] << endl; return 0; }