Physical Examination

Time Limit: 1000ms

Memory Limit: 32768KB

This problem will be judged on 

HDU. Original ID: 

64-bit integer IO format: %I64d      Java class name: Main

 

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.

 

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≤ai,bi<231.

 

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.

Source

 

解题：贪心。贪心策略就是：假设先选1号，再选2号项目，那么有　　

a₁ + a₁*b₂ + b₂ < a₂ + a₂b₁ + a₁

 _.

 

这样排完序即可。

 

1 #include 
        
          2 #include 
         
           3 #include 
          
            4 #include 
           
             5 #include 
            
              6 #include 
             
               7 #include 
              
                8 #include 
               
                 9 #include 
                
                 10 #include 
                 
                  11 #include 
                  
                   12 #include 
                   
                    13 #define LL long long14 #define pii pair
                    
                     15 #define INF 0x3f3f3f3f16 using namespace std;17 const int maxn = 100010;18 const LL mod = 365*24*60*60;19 struct node{20 int x,y;21 };22 node e[maxn];23 bool cmp(const node &a,const node &b){24 return (LL)a.x*b.y < (LL)b.x*a.y;25 }26 int main() {27 int n;28 LL ans;29 while(scanf("%d",&n),n){30 for(int i = 0; i < n; i++)31 scanf("%d %d",&e[i].x,&e[i].y);32 sort(e,e+n,cmp);33 ans = e[0].x;34 for(int i = 1; i < n; i++){35 ans += (e[i].x + ans*e[i].y)%mod;36 ans %= mod;37 }38 printf("%I64d\n",ans);39 }40 return 0;41 }