joj 1387

又见0-1背包，长度既是价值也是体积。

#include<iostream>
#include<stdio.h>
using namespace std;
int dp[100000];
int cd[105];
int main()
{
    int cd_sto;
    while(scanf("%d",&cd_sto)!=EOF)
    {
        int n;
        scanf("%d",&n);
        int i,j;
        for(i=1;i<=n;i++)
            scanf("%d",&cd[i]);
        for(i=0;i<cd[1];i++)
            dp[i]=0;
        for(i=cd[1];i<=cd_sto;i++)
            dp[i]=cd[1];
        for(i=2;i<=n;i++)
            for(j=cd_sto;j>=cd[i];j--)
            {
               dp[j]=((dp[j-cd[i]]+cd[i])>dp[j])?(dp[j-cd[i]]+cd[i]):dp[j];
               //cout<<j<<" "<<dp[j]<<endl;
            }
        printf("sum:%d\n",dp[cd_sto]);
    }
}