51nod-0-1背包问题

<span style="font-size:18px;">

#include<cstdio>#include<cstring>int f[10000+11];struct node{int wi;//体积 int pi;//价值 }arr[110];int max(int a,int b){if(a>b)return a;return b; } int main(){int n,w;scanf("%d%d",&n,&w);for(int i=1;i<=n;++i)scanf("%d%d",&arr[i].wi,&arr[i].pi);memset(f,0,sizeof(f));for(int i=1;i<=n;++i){for(int j=w;j>=arr[i].wi;--j){f[j]=max(f[j],f[j-arr[i].wi]+arr[i].pi);}}printf("%d\n",f[w]);}

</span>