题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=289
0-1背包水过~~
我的代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main(){
int dp[1200];
int i,j,k,t;
int n,v,a,b;
while(~scanf("%d%d",&n,&v),v&&n){
memset(dp,0,sizeof(dp));
for(i=0;i<n;i++){
scanf("%d%d",&a,&b);
for(j=v;j>=a;j--)
dp[j]=max(dp[j],dp[j-a]+b);
}
printf("%d\n",dp[v]);
}
return 0;
}