hdu4508解题报告

水题，完全背包~~

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int n,m;int dp[100008];int a[108],b[108];int main(){        while(scanf("%d",&n)!=EOF)        {              for(int i=1;i<=n;i++)                scanf("%d%d",&a[i],&b[i]);              scanf("%d",&m);              memset(dp,0,sizeof(dp));              for(int i=1;i<=n;i++)                for(int j=b[i];j<=m;j++)                        dp[j]=max(dp[j],dp[j-b[i]]+a[i]);                printf("%d\n",dp[m]);        }}