0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 20:48:48 +00:00

P1802 5倍经验日

R55702811
This commit is contained in:
Baoshuo Ren 2021-08-12 19:53:18 +08:00 committed by Baoshuo Ren
parent 266211ef37
commit 2c2a273527
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

View File

@ -0,0 +1,19 @@
#include <bits/stdc++.h>
using namespace std;
int n, x, lose[1005], win[1005], use[1005], f[1005];
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> lose[i] >> win[i] >> use[i];
}
for (int i = 1; i <= n; i++) {
for (int j = x; j >= 0; j--) {
f[j] = max(f[j] + lose[i], j >= use[i] ? f[j - use[i]] + win[i] : f[j] + lose[i]);
}
}
cout << 5ll * f[x] << endl;
return 0;
}