HDU 1171 01背包

http://acm.hdu.edu.cn/showproblem.php?pid=1171

 

基础的01背包，求出总值sum，背包体积即为sum/2

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int pr[5005],bao[250010];
int main()
{
    int sum,i,j,k,m,n,a;
    while(scanf("%d",&n)!=EOF)
    {
        if(n<=0)
            break;
        memset(bao,0,sizeof(bao));
        sum=0;
        i=0;
        for(j=0;j<n;j++)
        {
            scanf("%d%d",&a,&m);
            while(m--)
            {
                pr[i++]=a;
                sum+=a;
            }
        }
        for(j=0;j<i;j++)
        {
            for(k=sum/2;k>=pr[j];k--)
            {
                bao[k]=max(bao[k],bao[k-pr[j]]+pr[j]);
            }
        }
        printf("%d %d\n",sum-bao[sum/2],bao[sum/2]);
    }
    return 0;
}