hdu 4508 湫湫系列故事——减肥记I

完全背包

#include<stdio.h>#include<string.h>int dp[100010];int max(int a,int b){return a>b?a:b;}int main(){int w[110],v[110];int n,m,i,j;while(~scanf("%d",&n)){memset(dp,0,sizeof(dp));for(i=0;i<n;i++){scanf("%d%d",&v[i],&w[i]);}scanf("%d",&m);for(i=0;i<n;i++){for(j=w[i];j<=m;j++){dp[j]=max(dp[j],dp[j-w[i]]+v[i]);}}printf("%d\n",dp[m]);}return 0;}