hdu 4442 Physical Examination
来源:互联网 发布:冬天男鞋推荐知乎 编辑:程序博客网 时间:2024/05/16 09:51
Description
WANGPENG is a freshman. He is requested to have a physical examination when entering the university.
Now WANGPENG arrives at the hospital. Er….. There are so many students, and the number is increasing!
There are many examination subjects to do, and there is a queue for every subject. The queues are getting longer as time goes by. Choosing the queue to stand is always a problem. Please help WANGPENG to determine an exam sequence, so that he can finish all the physical examination subjects as early as possible.
Now WANGPENG arrives at the hospital. Er….. There are so many students, and the number is increasing!
There are many examination subjects to do, and there is a queue for every subject. The queues are getting longer as time goes by. Choosing the queue to stand is always a problem. Please help WANGPENG to determine an exam sequence, so that he can finish all the physical examination subjects as early as possible.
Input
There are several test cases. Each test case starts with a positive integer n in a line, meaning the number of subjects(queues).
Then n lines follow. The i-th line has a pair of integers (ai, bi) to describe the i-th queue:
1. If WANGPENG follows this queue at time 0, WANGPENG has to wait for ai seconds to finish this subject.
2. As the queue is getting longer, the waiting time will increase bi seconds every second while WANGPENG is not in the queue.
The input ends with n = 0.
For all test cases, 0<n≤100000, 0≤a i,b i<2 31.
Then n lines follow. The i-th line has a pair of integers (ai, bi) to describe the i-th queue:
1. If WANGPENG follows this queue at time 0, WANGPENG has to wait for ai seconds to finish this subject.
2. As the queue is getting longer, the waiting time will increase bi seconds every second while WANGPENG is not in the queue.
The input ends with n = 0.
For all test cases, 0<n≤100000, 0≤a i,b i<2 31.
Output
For each test case, output one line with an integer: the earliest time (counted by seconds) that WANGPENG can finish all exam subjects. Since WANGPENG is always confused by years, just print the seconds mod 365×24×60×60.
Sample Input
51 22 33 44 55 60
Sample Output
1419
Hint
In the Sample Input, WANGPENG just follow the given order. He spends 1 second in the first queue, 5 seconds in the 2th queue, 27 seconds in the 3th queue, 169 seconds in the 4th queue, and 1217 seconds in the 5th queue. So the total time is 1419s. WANGPENG has computed all possible orders in his 120-core-parallel head, and decided that this is the optimal choice.
0 0
- hdu 4442 Physical Examination
- HDU 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu - 4442 - Physical Examination
- HDU 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu 4442 Physical Examination
- HDU 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu 4442 Physical Examination
- hdu 4442 Physical Examination (排序)
- 贪心--HDU - 4442 Physical Examination
- HDU 4442 Physical Examination (贪心)
- HDU-#4442 Physical Examination(贪心)
- hdu 4442 Physical Examination(贪心)
- hdu 4442 Physical Examination(水题)
- C++ 语言的 15 个晦涩特性
- struts国际化操作中遇到display标签的处理办法
- hdu 3714 Error Curves
- 时隔多年重回csdn
- SpringMVC详细示例
- hdu 4442 Physical Examination
- validate的扩展方法
- U-BOOT中mkconfig详解
- ASP.NET DropDownList控件回传值无刷新操作。
- Drools入门-----------环境搭建,分析Helloworld Drools5.0的xls文件转drl文件提升解析效率 使用BRMS的Tomcat6.0配置
- cocos2d-x 3.6 程序流程
- Android开发:shape和selector和layer-list的(详细说明)
- freeswitch与E1设备对接方法
- 新工作要做的事宜