C - Knapsack problem
题目链接:FZU - 2214基本就是个裸背包了.....
比赛时竟然没想到......
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int dp[5005];
const int INF=0x3f3f3f3f;
int v[505], w[505];
int sum;
int main(){
int T;
cin >>T;
while(T--){
int n, B;
cin >>n >>B;
sum=0;
for(int i=1; i<=n; i++){
cin >>w[i] >> v[i];
sum+=v[i];
}
memset(dp, INF, sizeof(dp));
dp[0]=0;
for(int i=1; i<=n; i++){
for(int j=sum; j>=v[i]; j--){
dp[j]=min(dp[j], dp[j-v[i]]+w[i]);
}
}
for(int j=sum; j>=0; j--){
if(dp[j]<=B){
cout << j <<endl;
break;
}
}
}
return 0;
}