学习的话 在这里 http://wenku.baidu.com/view/8ab3daef5ef7ba0d4a733b25.html
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[202];
int max(int a,int b){
return a>b?a:b;
}
int main(){
int T,n,V,i,j,w,v,num,k;
scanf("%d",&T);
while(T--){
scanf("%d%d",&V,&n);
memset(dp,0,sizeof(dp));
for(i=1;i<=n;++i){
scanf("%d%d%d",&w,&v,&num);
k=1;
if(num>V/w) num=V/w;
while(num>0){
if(k>num) k=num;
num-=k;
for(j=V;j>=k*w;--j){
dp[j]=max(dp[j],dp[j-k*w]+k*v);
}
k<<=1;
}
}
printf("%d\n",dp[V]);
}
return 0;
}