25 lines
592 B
C++
25 lines
592 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
const int N = 1010;
|
|
const int M = 110;
|
|
int n;
|
|
int m1, m2;
|
|
int f[N][M][M];
|
|
|
|
int main() {
|
|
cin >> n >> m1 >> m2;
|
|
for (int i = 1; i <= n; i++) {
|
|
int v1, v2, w;
|
|
cin >> v1 >> v2 >> w;
|
|
for (int j = 0; j <= m1; j++)
|
|
for (int k = 0; k <= m2; k++) {
|
|
f[i][j][k] = f[i - 1][j][k];
|
|
if (j >= v1 && k >= v2)
|
|
f[i][j][k] = max(f[i - 1][j][k], f[i - 1][j - v1][k - v2] + w);
|
|
}
|
|
}
|
|
printf("%d", f[n][m1][m2]);
|
|
return 0;
|
|
}
|