HDU1171-Big Event in HDU
来源:互联网 发布:淘宝购物的步骤 编辑:程序博客网 时间:2024/05/16 14:27
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36398 Accepted Submission(s): 12639
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).
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.
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
Author
lcy
#include <iostream>#include <algorithm>#include <stdio.h>#include <queue>#include <string.h>using namespace std;int x[5010];int dp[255555];int main(){ int n; while(~scanf("%d",&n)&&n) { memset(dp,0,sizeof dp); memset(x,0,sizeof x); int a,b; int k=0,sum=0; for(int i=0;i<n;i++) { scanf("%d %d",&a,&b); while(b--) { x[k++]=a;sum+=a; } } for(int i=0;i<k;i++) { for(int j=sum/2;j>=x[i];j--) dp[j]=max(dp[j],dp[j-x[i]]+x[i]); } printf("%d %d\n",sum-dp[sum/2],dp[sum/2]); } return 0;}
0 0
- HDU1171 Big Event in HDU
- HDU1171--Big Event in HDU
- HDU1171 Big Event in HDU
- HDU1171 Big Event in HDU
- hdu1171 Big Event in HDU
- hdu1171 Big Event in HDU
- HDU1171-Big Event in HDU
- hdu1171 Big Event in HDU
- HDU1171 Big Event in HDU
- hdu1171 Big Event in HDU
- hdu1171之Big Event in HDU
- Big Event in HDU hdu1171 多重背包
- HDU1171:Big Event in HDU(01背包)
- HDU1171:Big Event in HDU(多重背包)
- hdu1171 Big Event in HDU (多重背包)
- hdu1171---Big Event in HDU(多重背包)
- hdu1171 Big Event in HDU 01-背包
- HDU1171 Big Event in HDU 【母函数】
- 操作系统μC/OS-Ⅱ读书笔记(2)
- 利用torque搭建分布式程序运行环境
- Timus Online Judge:2010. Sasha the Young Grandmaster
- 楼新闻
- HDU 5873 Football Games 【模拟】 (2016 ACM/ICPC Asia Regional Dalian Online)
- HDU1171-Big Event in HDU
- LibGdx文档译读(五)Graphics接口
- hdu 5877 Weak Pair(dfs+树状数组)
- Hibernate的HQL中in参数设置
- Android Studio常用快捷键
- 生成短信验证码的方法
- 【计算机视觉】<前景检测>非参数背景模型介绍<二>
- 《java多线程编程核心技术》读书笔记3:线程间的通信
- 在MyEclipse10上远程连接虚拟机上的Hive,报错:Could not establish connection to 192.168.1.100:10000/log: java.net.Co