HDU4296--Buildings
来源:互联网 发布:淘宝全球购官网 编辑:程序博客网 时间:2024/05/22 11:48
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
#include <iostream>#include <algorithm>#include <cstdio>using namespace std;#define maxn 100008#define LL long long intLL sum[maxn];struct Floor{LL w,s;}flor[maxn];bool cmp(Floor a,Floor b){return a.w+a.s < b.w+b.s;}inline int max(int a,int b){return a>b?a:b;}int main(){int n;while(scanf("%d",&n)!=EOF){for(int i=1;i<=n;i++){scanf("%I64d%I64d",&flor[i].w,&flor[i].s);}sort(flor+1,flor+n+1,cmp);sum[1] = 0;LL ans = 0;for(int i=2;i<=n;i++){sum[i] = sum[i-1] + flor[i-1].w;ans = max(ans,sum[i] - flor[i].s);}printf("%I64d\n",ans);}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
- JBuilder特点
- 企业信息化杂汤:信息化的价值(6)
- erlang17.4 + centos6.4 install
- python3 终端下英汉词典 BeautifulSoup+网络爬虫
- abstractembeddedcomponents.cid
- HDU4296--Buildings
- C语言求任意四边形面积和其关联的三角形面积的关系
- apache camel 在诗篇建站系统的应用
- 在一个字符串中找到第一个只出现一次的字符(17)
- Camel的数据转换
- DBA日常工作职责
- mongodb入门-2 文档、集合、数据库
- Camel-MongoDb
- hdu 4548 美素数 金山居