洛谷P1802
点击查看代码
#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
long long dp[N];
int main() {
int n, x; cin >> n >> x;
int lose, win, use;
for(int i = 0; i < n; i++) {
cin >> lose >> win >> use;
for(int j = x; j >= 0; j--) {
if(j >= use) dp[j] = max(dp[j] + lose, dp[j - use] + win);
else dp[j] += lose;
}
}
cout << dp[x] * 5 << '\n';
return 0;
}

浙公网安备 33010602011771号