hdoj 2602 0-1背包

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11958    Accepted Submission(s): 4622


Problem Description
InputOutputSample InputSample Output#include <iostream>#include <cstdio>#include <cstring>using namespace std;int max(int x,int y){ if(x>y)return x; else return y;}int main(){int test,n,V,i,j;int value[1010],v[1010],f[1010];scanf("%d",&test);while(test--){scanf("%d%d",&n,&V);memset(f,0,sizeof(f));for (i=1;i<=n;i++){scanf("%d",&value[i]);}for (i=1;i<=n;i++){scanf("%d",&v[i]);}for (i=1;i<=n;i++){for (j=V;j>=v[i];j--){f[j]=max(f[j],f[j-v[i]]+value[i]);}}printf("%d\n",f[V]);}return 0;}