#include <iostream>
using namespace std;
typedef long long LL;
const int N = 1010;
int n, m;
LL f[N][N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ )
{
int l, w, u;//输的经验,赢的经验,消耗的药
scanf("%d%d%d", &l, &w, &u);
for (int j = m; j >= 0; j -- )
{
if (j < u)
f[i][j] = max(f[i][j], f[i - 1][j] + l);
else
f[i][j] = max(f[i - 1][j] + l, f[i - 1][j - u] + w);
}
}
cout << 5 * f[n][m] << endl;
return 0;
}
5倍经验日——洛谷1802
于 2023-02-01 22:37:42 首次发布