460

# 题目

## 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.

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

20 10
40 40

# 翻译

>

## 输入

N 为负数时表示输入结束

>

5 2
10 1

# 代码

/*
By:OhYee
Github:OhYee
Blog:http://www.oyohyee.com/
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！

*/
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <iostream>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
using namespace std;

const int maxn = 1000;
const int maxv = 300000;
const int INF = 0x7fffffff;
int dp[maxv];
int value[maxn],num[maxn];
int Max;
int v;

void ZeroOnePack(int cost,int weight) {
for(int i = v; i >= cost; i--)
dp[i] = max(dp[i],dp[i - cost] + weight);
}
void CompletePack(int cost,int weight) {
for(int i = cost; i <= v; i++)
dp[i] = max(dp[i],dp[i - cost] + weight);
}
void MultiplePack(int cost,int weight,int n) {
if(cost * n > v) {
CompletePack(cost,weight);
} else {
int k = 1;
while(k < n) {
ZeroOnePack(cost * k,weight * k);
n -= k;
k *= 2;
}
ZeroOnePack(cost * n,weight * n);
}
}

bool  Do() {
int n;
scanf("%d",&n);
if(n < 0)
return false;

Max = 0;

for(int i = 1;i <= n;i++) {
scanf("%d%d",&value[i],&num[i]);
Max += value[i] * num[i];
}

v = Max / 2;
memset(dp,0,sizeof(dp));

for(int i = 1;i <= n;i++) {
MultiplePack(value[i],value[i],num[i]);
}

int ans = 0;
for(int i = v;i >= 0;i--) {
if(dp[i] != 0) {
ans = dp[i];
break;
}
}

printf("%d %d\n",Max - ans,ans);
return true;
}

int main() {
while(Do());
return 0;
}

• 点击查看/关闭被识别为广告的评论