hdu4296 Buildings
来源:互联网 发布:娱乐圈爆料知乎天涯 编辑:程序博客网 时间:2024/06/11 04:35
Buildings
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1380 Accepted Submission(s): 584
Problem Description
Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accomplished many great projects, one of which is the Guanghua Building.
The public opinion is that Guanghua Building is nothing more than one of hundreds of modern skyscrapers recently built in Shanghai, and sadly, they are all wrong. Blue.Mary the great civil engineer had try a completely new evolutionary building method in project of Guanghua Building. That is, to build all the floors at first, then stack them up forming a complete building.
Believe it or not, he did it (in secret manner). Now you are face the same problem Blue.Mary once stuck in: Place floors in a good way.
Each floor has its own weight wi and strength si. When floors are stacked up, each floor has PDV(Potential Damage Value) equal to (Σwj)-si, where (Σwj) stands for sum of weight of all floors above.
Blue.Mary, the great civil engineer, would like to minimize PDV of the whole building, denoted as the largest PDV of all floors.
Now, it’s up to you to calculate this value.
The public opinion is that Guanghua Building is nothing more than one of hundreds of modern skyscrapers recently built in Shanghai, and sadly, they are all wrong. Blue.Mary the great civil engineer had try a completely new evolutionary building method in project of Guanghua Building. That is, to build all the floors at first, then stack them up forming a complete building.
Believe it or not, he did it (in secret manner). Now you are face the same problem Blue.Mary once stuck in: Place floors in a good way.
Each floor has its own weight wi and strength si. When floors are stacked up, each floor has PDV(Potential Damage Value) equal to (Σwj)-si, where (Σwj) stands for sum of weight of all floors above.
Blue.Mary, the great civil engineer, would like to minimize PDV of the whole building, denoted as the largest PDV of all floors.
Now, it’s up to you to calculate this value.
Input
There’re several test cases.
In each test case, in the first line is a single integer N (1 <= N <= 105) denoting the number of building’s floors. The following N lines specify the floors. Each of them contains two integers wi and si (0 <= wi, si <= 100000) separated by single spaces.
Please process until EOF (End Of File).
In each test case, in the first line is a single integer N (1 <= N <= 105) denoting the number of building’s floors. The following N lines specify the floors. Each of them contains two integers wi and si (0 <= wi, si <= 100000) separated by single spaces.
Please process until EOF (End Of File).
Output
For each test case, your program should output a single integer in a single line - the minimal PDV of the whole building.
If no floor would be damaged in a optimal configuration (that is, minimal PDV is non-positive) you should output 0.
If no floor would be damaged in a optimal configuration (that is, minimal PDV is non-positive) you should output 0.
Sample Input
310 62 35 422 22 2310 32 53 3
Sample Output
102
Source
2012 ACM/ICPC Asia Regional Chengdu Online
Recommend
liuyiding
贪心做这可以了
#include <iostream>#include <string.h>#include <algorithm>#include <stdio.h>using namespace std;#define MAXN 100500struct node { __int64 w,s;}p[MAXN];bool cmp(node a,node b){ return a.w+a.s<b.w+b.s;}int main(){ int n,i; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { scanf("%I64d%I64d",&p[i].w,&p[i].s); } sort(p,p+n,cmp); __int64 maxx=-1,sum=0; for(i=0;i<n;i++) { maxx=max(maxx,sum-p[i].s); sum+=p[i].w; } printf("%I64d\n",maxx); } return 0;}
- HDU4296--Buildings
- hdu4296 Buildings
- hdu4296 Buildings
- 【贪心】 hdu4296 Buildings
- HDU4296 Buildings 贪心
- hdu4296 Buildings 贪心
- hdu4296 Buildings(贪心)
- 2012成都赛区网络赛第九题---Buildings(hdu4296)
- HDU4296 2012ACM成都赛区网络赛 Buildings
- hdu4296
- HDU4296
- HDU4296
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- WPF中的逻辑树与可视树
- Android学习基础篇——高级界面设计(二)
- Linux 指定运行时动态库路径[-rpath]
- cmd运行java类环境变量的配置
- SMPP是一种通用的短信接口协议
- hdu4296 Buildings
- Unsupported major.minor version 51.0解决办法
- Sqlite工具类
- Hbase 基本应用及命令
- hdu4460 Friend Chains
- 如何去掉字符串前面的0
- MVC hyperlink
- 各种开源许可证的区别
- hibernate中如何对没有id的表进行管理