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[],bao[];
 int main()
 {
     int sum,i,j,k,m,n,a;
     while(scanf("%d",&n)!=EOF)
     {
         if(n<=)
             break;
         memset(bao,,sizeof(bao));
         sum=;
         i=;
         for(j=;j<n;j++)
         {
             scanf("%d%d",&a,&m);
             while(m--)
             {
                 pr[i++]=a;
                 sum+=a;
             }
         }
         for(j=;j<i;j++)
         {
             for(k=sum/;k>=pr[j];k--)
             {
                 bao[k]=max(bao[k],bao[k-pr[j]]+pr[j]);
             }
         }
         printf("%d %d\n",sum-bao[sum/],bao[sum/]);
     }
     return ;
 }