Big Event in HDU

原创 2015年07月07日 15:20:24
I - Big Event in HDU
Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

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
 

Sample Output

20 10 40 40
 
/*
Author: 2486
Memory: 2404 KB		Time: 1138 MS
Language: G++		Result: Accepted
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=50*100*50+5;
struct bgs {
    int val,num;
} bgses[maxn];
int N;
int dp[maxn];
int main() {
    while(~scanf("%d",&N)) {
        if(N<0)break;
        int ans=0;;
        memset(dp,0,sizeof(dp));
        for(int i=0; i<N; i++) {
            scanf("%d%d",&bgses[i].val,&bgses[i].num);
            ans+=bgses[i].val*bgses[i].num;
        }
        for(int i=0; i<N; i++) {
            for(int j=0; j<bgses[i].num; j++) {
                for(int k=ans/2; k>=bgses[i].val; k--) {
                        dp[k]=max(dp[k],dp[k-bgses[i].val]+bgses[i].val);
                }
            }
        }
        printf("%d %d\n",ans-dp[ans/2],dp[ans/2]);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU1171:Big Event in HDU(01背包)

Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. B...

HDU 1171 Big Event in HDU (母函数)

题意:有n样物品,每样物品价值是v,件数是m。尽量把这些物品分成两堆使得两边总价值最接近。输出分得的两堆各自的价值。 利用母函数法来解决,因为分成两堆,而两堆中较小的一堆最大为所有物品总价值量的一半,...

HDOJ1171 Big Event in HDU

Big Event in HDU Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other...

HDU 1171 Big Event in HDU(母函数||DP)

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

HDU 1171 Big Event in HDU 【母函数】

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

B - Big Event in HDU(背包问题多重背包)

B - Big Event in HDU Nowadays, we all know that Computer College is the biggest department in HDU...

母函数之Big Event in HDU hdoj 1171

/* Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/O...

HDOJ--1171--Big Event in HDU

Big Event in HDU Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

HDOJ Big Event in HDU 多重背包

第一次遇到这样的题,平分= =,还要回去好好想一下... 这么水的... 不懂啊= = #include #include #include using namespace std; int m...

HDOJ-1171-Big Event in HDU 解题报告

普通母函数。题意:有最多50种不同价值的机器,每种机器的价值不超过50并且数量不超过100,现在要把这些机器分成A和B两部分,使两部分机器的价值尽可能相等且A的价值不能够小于B。      ...
  • JZQT_T
  • JZQT_T
  • 2015年05月21日 18:56
  • 384
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Big Event in HDU
举报原因:
原因补充:

(最多只允许输入30个字)