UVA 624 CD (01背包)

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int value[30],dp[10001],s[30][10001];

int main()
{
    int n,m;
    while(cin>>m)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
        cin>>value[i];
        memset(dp,0,sizeof(dp));
        memset(s,0,sizeof(s));
        for(int i=1;i<=n;i++)
         for(int j=m;j>=value[i];j--)
          if(dp[j]<=dp[j-value[i]]+value[i])
          {
              dp[j]=dp[j-value[i]]+value[i];
              s[i][j]=1;
          }
        for(int i=n,j=m;i>=1;i--)
        {
            if(s[i][j])
            {
                cout<<value[i]<<" ";
                j=j-value[i];
            }
        }
        cout<<"sum:"<<dp[m]<<endl;
    }
    return 0;
}