HDU1171 Big Event in HDU（变形01背包）

原创

wx63db9cf49ed95 2023-02-04 08:55:52 博主文章分类：笔记 ©著作权

文章标签 #include Computer sed 文章分类 虚拟化云计算

©著作权归作者所有：来自51CTO博客作者wx63db9cf49ed95的原创作品，请联系作者获取转载授权，否则将追究法律责任

Description

Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
A test case starting with a negative integer terminates input and this test case is not to be processed.

Output

For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.

Sample Input

2 10 1 20 1 3 10 1 20 2 30 1 -1

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;
int dp[150000],b[10000];
int main()
{
    int N;
    while(scanf("%d",&N)&&N>0)
    {
        int total=0,p=0;
        int v,m;
        for(int i=0;i<N;i++)
        {
            scanf("%d %d",&v,&m);
            total += v*m;
            for(int j=0;j<m;j++)
            b[p++]=v;
        }
        memset(dp,0,sizeof(dp));
        for(int i=0; i<p;i++)
            for(int j=total/2;j>=b[i];j--)
              dp[j]=max(dp[j],dp[j-b[i]]+b[i]);
        printf("%d %d\n",max(dp[total/2],total-dp[total/ 2]),min(dp[total/2],total-dp[total/2]));
    }
    return 0;
}