二进制优化多重背包

#include <bits/stdc++.h>
using namespace std;
const int M = 10005;
const int N = 10005;
#define ri register int
struct setdian{
    int val,v;
}p[N];
int n,v,w,num,cent,f[N];
int main(){
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d%d",&num,&v,&w);
        for(ri k=1;k<=num;k<<1)
        {
          p[++cent].v=k*v;
          p[cent].val=k*w;    
        }
        if(p[cent].v<num*v)
        p[++cent].v=num*v,p[cent].val=num*w;
    }
    scanf("%d",&v);
    for(ri i=1;i<=cent;i++)
    for(ri j=v;j>=p[i].v;j--)
    {
        f[j]=max(f[j-p[i].v]+p[i].val,f[j]);
    }
    
}