B - CD UVA - 624

https://cn.vjudge.net/contest/224070#problem/B

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <vector>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 #define N  100005
 #define mod 530600414
 #define mem(a,b) memset(a,b,sizeof(a))
 #define ll  long long
 int n,m;
 int w[];
 int dp[N];
 bool pre[][N];
 int main()
 {
     while(~scanf("%d%d",&n,&m)){
         mem(pre,);
         mem(dp,);
         for(int i=;i<m;i++) scanf("%d",&w[i]);
         for(int i=m-;i>=;i--) {//要按输入顺序输出
             for(int j=n;j>=w[i];j--){
                 if(dp[j]<dp[j-w[i]]+w[i]){
                     dp[j]=dp[j-w[i]]+w[i];
                     pre[i][j]=;
                 }
             }
         }
         int j=n;
         for(int i=;i<m&&j>;i++){//从前往后查询，因此上面的更新要从后往前
                 if(pre[i][j]){
                     printf("%d ",w[i]);
                     j-=w[i];
                 }
         }
         printf("sum:%d\n",dp[n]);
     }
     return ;
 }