HDU 1171-Big Event in HDU
来源:互联网 发布:centos7 查看端口 编辑:程序博客网 时间:2024/06/04 01:35
Big Event in HDU
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43257 Accepted Submission(s): 14869
题目链接:点击打开链接
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
2
10 1
20 1
3
10 1
20 2
30 1
-1
Sample Output
20 10
40 40
2
10 1
20 1
3
10 1
20 2
30 1
-1
Sample Output
20 10
40 40
分析:01背包的变形。和邮票分你一半是一个类型的题。
#include <iostream>#include<stdio.h>#include<cmath>#include<string.h>using namespace std;int main(){ int n,v,j,m,sum,s[5010],dp[250010]; while(scanf("%d",&n)&&n>0) { j=0; sum=0; memset(s,0,sizeof(s)); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) { scanf("%d %d",&v,&m); while(m--) { s[j++]=v; sum+=v; } } for(int i=0;i<j;i++) { for(int k=sum/2;k>=s[i];k--) dp[k]=max(dp[k],dp[k-s[i]]+s[i]); } printf("%d %d\n",sum-dp[sum/2],dp[sum/2]); } return 0;}
阅读全文
0 0
- 1171 Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- Big Event in HDU
- How can we identify the weights of different models for ensemble?
- cygwin使用Windows下的python
- Sort it
- 配置文件报错:不允许有匹配 "[xX][mM][lL]" 的处理指令目标
- 利用UiAutomator和httpclient写自动发表笑话到微信朋友圈功能
- HDU 1171-Big Event in HDU
- 2017"百度之星"程序设计大赛
- 函数响应式编程及ReactiveObjC学习笔记 (-)
- 协同过滤算法
- 杭电acm2000 ASCII码排序
- C#的数据类型
- 友员
- Buffer(ByteBuffer)以及flip,clear及rewind区别
- Trie详解