POJ-1276-Cash Machine-多重背包

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <vector>
using namespace std;
double eps=0.0000001;

int max(int a,int b){return a>b?a:b;}
struct node
{
int num,val;
};
node tm[15];
node nnn[105];
const double inf=2147483647;
int cmp(node a,node b)
{
return a.val<b.val;
}

int dp[100005];
int main()
{
int i,j;
int n,m;
while(scanf("%d",&n)!=EOF)
{
memset(dp,0,sizeof(dp));
scanf("%d",&m);
for (i=1;i<=m;i++)
{
scanf("%d %d",&tm[i].num,&tm[i].val);
}
int cun=0;
for (i=1;i<=m;i++)		//二进制拆分
{
int k=1;
int tt=tm[i].num;
int v=tm[i].val;
while(k<=tt)
{
nnn[++cun].val=v;
nnn[cun].num=k;
tt=tt-k;
k=k*2;
}
if (!tt)  continue;  //价值为0的物品集无意义
nnn[++cun].val=v;
nnn[cun].num=tt;//余数
}

dp[0]=1;
for (i=1;i<=cun;i++)
{
int vv=nnn[i].val*nnn[i].num;
for (j=n;j>=vv;j--)
{

dp[j]=max(dp[j],dp[j-vv]);
}
}
for (j=n;j>=0;j--)
{
if (dp[j])
{
printf("%d\n",j);
break;
}
}

}
return 0;

}