Uva 624 - CD

 /// Header file begin
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include<utility>
#include <queue>
#include <algorithm>
#include<cstdlib>
/// End
//..........
/// Macro
#define sf scanf
#define pf printf
#define sfint(a,b) scanf("%d %d",&a,&b)
#define sfl(a,b) scanf("%ld %ld",&a,&b)
#define sfll(a,b) scanf("%lld %lld",&a,&b)
#define sfd(a,b) scanf("%lf %lf",&a,&b)
#define sff(a,b) scanf("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define mem(c,v) memset(c,v,sizeof(c))
#define cp(a) cout<<" "<<a<<" "
#define nl puts("")
#define sq(x) ((x)*(x))
#define all(x) x.begin(),x.end()
#define reall(x) x.rbegin(),x.rend()
#define sz size()
#define gc getchar()
#define pb push_back
#define freader freopen("input.txt","r",stdin)
/// End.........

/// Size
#define mx7 20000100
#define mx6 1500000
#define mx5 100005
#define mx4 1000100
#define inf 1<<30                                           //infinity value
#define eps 1e-9
#define mx (5540)
#define mod 1000000007
#define pi acos(-1.0)

/// Macros for Graph

#define white 1
#define gray 2
#define black 3
#define nil 0

using namespace std;
/***************/

/// typedef

typedef long long LL;
typedef long L;
typedef unsigned long long ull;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef vector<int>vi;
typedef vector<long long> vll;
typedef vector<long>vl;
typedef vector<char>vch;
typedef vector<string>vs;
typedef map<int,int>mpii;
typedef map<int,bool>mpbi;
typedef map<long,bool>mpbl;
typedef map<long long,bool>mpbll;
typedef map<char,int>mpci;
typedef map<char,bool>mpbc;
typedef map<string,int>mpsi;
typedef map<long long,long long>mpll;

/// template

template<class T> T gcd(T a, T b ) {return b<=0?a:gcd(b,a%b);}
template<class T> T large(T a, T b ) {return a>b?a:b;}
template<class T> T small(T a, T b ) {return a<b?a:b;}
template<class T> T diffrnce(T a, T b) {return a-b<0?b-a:a-b;}

LL dp[mx][mx],track[mx],N,i,j,itm;

void display(LL i, LL j)
{
    if(i==0 or j==0)
    {
        return;
    }

    if(dp[i][j] == dp[i-1][j])
    {
        display(i-1,j);
    }

    else
    {
        display(i-1,j-track[i]);
        pf("%lld ",track[i]);
    }
}

void knapsack()
{
    for(i=1;i<=itm;i++)
    {
        for(j=1;j<=N;j++)
        {
            if(track[i] <= j)
            {
                dp[i][j] = max( dp[i-1][j] , track[i] + (dp[i-1][j-track[i]]) );
            }

            else
            {
                dp[i][j] = dp[i-1][j];
            }
        }
    }

    display(itm,N);
}

int main()
{
    while(~sf("%lld",&N))
    {
        sf("%lld",&itm);

        for(i=1;i<=itm;i++)
        {
            sf("%lld",&track[i]);
        }

        knapsack();

        pf("sum:%lld\n",dp[itm][N]);
    }

    return 0;
}