#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
return a % b == 0 ? b : gcd(b, a % b);
}
#define MAXN 10005
#define MAXD 30
int N,T;
int src[MAXD];
int dp[MAXN],fa[MAXN][MAXD];
void slove()
{
for (int i=1;i<=T;i++)
scanf("%d",&src[i]);
memset(dp,0,sizeof(dp));
memset(fa,0,sizeof(fa));
for (int i=1;i<=T;i++)
for (int j=N;j>=src[i];j--)
{
dp[j]=max(dp[j],dp[j-src[i]]+src[i]);
if (dp[j]==dp[j-src[i]]+src[i]) fa[j][i]=1;//在体积为J的时候选择第i个元素
}
}
void print(int v,int index)
{
//printf("%d %d\n",v,index);
if (index<=0) return;
if (fa[v][index]==0) print(v,index-1);
else
{
print(v-src[index],index-1);
printf("%d ",src[index]);
}
}
int main()
{
while (scanf("%d%d",&N,&T)!=EOF)
{
slove();
print(N,T);
printf("sum:%d\n",dp[N]);
}
return 0;
}
UVA 624 CD 0-1背包
最新推荐文章于 2021-02-22 20:03:08 发布