01背包
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1e5+1000;
int n,m;
int v[maxn],w[maxn];
int dp[maxn];
int main(){
cin>>n>>m;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
cin>>v[i]>>w[i];
}
for(int i=0;i<n;i++){
for(int j=m;j>=v[i];j--){
dp[j]=max(dp[j],dp[j-v[i]]+w[i]);
}
}
cout<<dp[m]<<endl;
return 0;
}
完全背包
#include<bits/stdc++.h>
using namespace std;
const int maxn=510;
const int inf=0x3f3f3f3f;
int v[maxn],w[maxn];
int dp[10005];
int main(){
int t;
cin>>t;
while(t--){
memset(dp,inf,sizeof(dp));
int e,f;
cin>>e>>f;
int n;
cin>>n;
dp[0]=0;
for(int i=0;i<n;i++){
cin>>v[i]>>w[i];
}
for(int i=0;i<n;i++)
for(int j=w[i];j<=f-e;j++){
dp[j]=min(dp[j],dp[j-w[i]]+v[i]);
}
if(dp[f-e]==inf) printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f-e]);
}
}