hdu1171 Big Event in HDU --01背包-白红宇的个人博客

发布日期：2021-10-03 20:32:28 浏览次数：2 分类：技术文章

本文共 1839 字，大约阅读时间需要 6 分钟。

原题链接：

一：原题内容

Problem 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

210 120 1310 1 20 230 1-1

Sample Output

20 1040 40

二：分析理解

直接看代码就懂了。

三：AC代码

#include
   
      #include
    
       using namespace std;int va[5005];int dp[250005];int a, b;int n;int main(){	while (~scanf("%d", &n) && n > 0)	{		memset(dp, 0, sizeof(dp));		int sum = 0;		int num = 1;		for (int i = 1; i <= n; i++)		{			scanf("%d%d", &a, &b);			while (b--)			{				va[num++] = a;				sum += a;			}		}		for (int i = 1; i < num; i++)			for (int j = sum / 2; j >= va[i]; j--)				dp[j] = max(dp[j - va[i]] + va[i], dp[j]);		printf("%d %d\n", sum - dp[sum / 2], dp[sum / 2]);	}	return 0;}

转载地址：https://blog.csdn.net/LaoJiu_/article/details/51207890 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！

上一篇：hdu2955 Robberies --01背包

下一篇：hdu2639 Bone Collector II--01背包K优解

发表评论

关于作者

喝酒易醉，品茶养心，人生如梦，品茶悟道，何以解忧？唯有杜康！

-- 愿君每日到此一游！

发表评论

最新留言

关于作者

推荐文章