多重背包问题II打卡

打卡多重背包

include

include

using namespace std;

const int N = 12010, M = 2010;
int v[N], w[N];
int f[N];

int main(){
int n, m;
cin >> n >> m;
int cnt = 0;
int a, b, s;
while(n --){
cin >> a >> b >> s;
int k = 1;
while(k <= s){
v[++cnt] = a * k;
w[cnt] = b * k;
s -= k;
k *= 2;
}
if(s){
v[++cnt] = s * a;
w[cnt] = s * b;
}
}
for(int i = 1; i <= cnt; i ++)
for(int j = m; j >= v[i]; j --)
f[j] = max(f[j], f[j - v[i]] + w[i]);
cout << f[m];
return 0;
}