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
2
10 1
20 1
3
10 1
20 2
30 1
-1
Sample Output
20 10
40 40
题目意思是说有N种物品价值为A的有B件,如第一组数据:2种物品,第一种价值为10有一件,第二种价值为20也是一件,把它们分成两部分,使得第一部分减第二部分的差最小(差大于等于0);
解法:背包,我们可以设背包容量为所有物品Value和的一半,因为差最小。01背包就可以用上了。
LANGUAGE:C
CODE:
#include<stdio.h>
#define maxn 1001
#define max(a,b) a>b?a:b
#include<string.h>
int main()
{
int value[maxn],num[maxn];
int f[125000],n,i,j,k,ave,sum;
while(scanf("%d",&n),n>-1)
{
sum=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&value[i],&num[i]);
sum+=value[i]*num[i];
}
memset(f,0,sizeof(f));ave=sum/2;
for(i=1;i<=n;i++)
{
for(j=1;j<=num[i];j++)
{
for(k=ave;k>=value[i];k--)
f[k]=max(f[k],f[k-value[i]]+value[i]);
}
}
printf("%d %d\n",sum-f[sum/2],f[sum/2]);
}
return 0;
}
分享到:
相关推荐
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
HDU1059的代码
杭电ACMhdu1163
hdu1001解题报告
HDU的一题........HDU DP动态规
hdu 1574 passed sorce
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
hdu2101AC代码
搜索 dfs 解题代码 hdu1241
ACM HDU题目分类,我自己总结的大概只有十来个吧
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
HDU最全ac代码
hdu-acm源代码(上百题)hdu-acm源代码、hdu-acm源代码hdu-acm源代码
hdu动态规划算法集锦
hdu 1166线段树代码
hdu题目分类
HDU图论题目分类
自己做的HDU ACM已经AC的题目
hdu 1005.比较简单的一道题,有兴趣的可以看看。