hdu1171---Big Event in HDU(多重背包)
发布日期:2022-02-02 02:58:10 浏览次数:4 分类:技术文章

本文共 2311 字,大约阅读时间需要 7 分钟。

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
 
题目大意:

Problem Description

    目前我们知道Computer College是HDU最大的部门,但是,可能你不知道在2002年,Computer College已经分成Computer College 和 Software College两部分,与此同时,出现了一个问题,所有的设施必须两等分,首先,所有的设施已经被估价,如果两种设施价格相同,则被认为是一样的,假设有N种设施(不同的价格,不同的种类)
 Input

     输入包括多组样例,每组样例第一行输入一个N(0 < N <= 50 ,不通风设施的总数)。接下来N行包括两个整数V(0<V<=50 )和M(0<M<=100 ),分别代表设施的价格和这种设施的个数,你可以假设所有的价格都是不同的,以输入复数结束;

 

 Output

每组样例,打印一行包括两个数A、B,分别代表两个大学可以得到的最大价值,A和B应该尽量相等,同时,保证A不小于B
   也就是使A和B的差值最小

代码实现:

#include 
   
    #include 
    
     using namespace std;int dp[100001];int value[101],num[101];int main(){
     
int n,i,j,k;
while(cin>>n)
{
if(n<0)break;
int sum=0;
for(i=0; i
{
cin>>value[i]>>num[i];
sum+=value[i]*num[i];
}
memset(dp,0,sizeof(dp));
for(i=0; i
{
for(j=1; j<=num[i]; j=j*2)
{
for(k=sum/2; k>=j*value[i]; k--)
{
dp[k]=max(dp[k],dp[k-j*value[i]]+value[i]*j);
}
num[i]-=j;
}
}
cout< }
return 0;}


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

上一篇:uva147Dollars(完全背包)
下一篇:hdu2639---Bone Collector II(01背包升华)

发表评论

最新留言

很好
[***.249.68.14]2022年05月23日 00时33分01秒

关于作者

    喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!

最新文章