湫湫系列故事——減肥記I

http://acm.hdu.edu.cn/showproblem.php?pid=4508

#include<iostream>#include<stdio.h>#include<cmath>#include<stdlib.h>#include<algorithm>using namespace std;int cmp(int a,int b){return a>b;} int main(){int n,m,i,j,dp[101000],c[110],var[110];while(~scanf("%d",&n)) {for(i=0;i<n;i++)scanf("%d%d",&var[i],&c[i]);scanf("%d",&m);int sum=0;memset(dp,0,sizeof(dp));dp[0]=1;for(i=0;i<n;i++){for(j=c[i];j<=m;j++)dp[j]=max(dp[j],dp[j-c[i]]+var[i]);}sort(dp,dp+m+1,cmp);printf("%d\n",dp[0]-1);}}