题目:http://acm.hdu.edu.cn/showproblem.php?pid=2602
裸01背包~~~
#include <stdio.h> #include <string.h> #define N 1000 int f[N+1]; int volume[N], value[N]; int n, v; int main() { int T, i, j,max; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&v); for(i=0; i<n; i++) scanf("%d",&value[i]); for(i=0; i<n; i++) scanf("%d",&volume[i]); memset(f,0,sizeof(f)); for(i=0; i<n; i++) for(j=v; j>=volume[i]; j--) { if(f[j] <f[ j-volume[i] ] + value[i]) f[j] = f[ j-volume[i] ] + value[i]; } max =f[0]; for(j=1;j<=v;j++) if(max<f[j]) max = f[j]; printf("%d\n",max); } return 0; }