hdu 4442 Physical Examination

Physical Examination

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5376    Accepted Submission(s): 1468

Problem 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.

 

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³¹.

 

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.
假设1队的（a1,b1），2队的（a2,b2）
如果先1再2，就是a1+(a1*b2)+a2；（A）
如果先2再1，就是a2+(a2*b1)+a1；（B）
假如A<B,那么a1*b2<a2*b1,所以这样sort一下就行了。。
#include <stdio.h>#include <string.h>#include <iostream>#include <string>#include <vector>#include <map>#include <queue>#include <stack>#include <math.h>#include <algorithm>using namespace std;typedef long long ll;#define rep(i,s,t) for(int i=s;i<t;i++)#define red(i,s,t) for(int i=s-1;i>=t;i--)#define ree(i,now) for(int i=head[now];i!=-1;i=edge[i].next)#define clr(a,v) memset(a,v,sizeof a)#define max(a,b) (a<b?b:a)#define min(a,b) (a<b?a:b)#define abs(a) ((a)<0?-(a):(a))#define L t<<1#define R t<<1|1#define MID int mid=(l+r)>>1inline int input(){    int ret=0;char c=getchar();    while(c<'0' || c>'9'){        c=getchar();    }    while(c>='0' && c<='9'){        ret=ret*10+c-'0';        c=getchar();    }    return ret;}inline void output(int x){    if(x<0){        putchar('-');x=-x;    }    int len=0,data[10];    while(x){        data[len++]=x%10;x/=10;    }    if(!len)    data[len++]=0;    while(len--)        putchar(data[len]+48);    putchar('\n');}const int MAXN=100005;const ll mod=365*24*60*60;struct node{    int a,b;    void read(){        a=input(),b=input();    }}q[MAXN];bool cmp(node i,node j){    return i.a*1LL*j.b < i.b*1LL*j.a;}int n;int main(){    while(n=input(),n){        rep(i,0,n) q[i].read();        sort(q,q+n,cmp);        ll ans=0,p=0;        rep(i,0,n) ans=p*q[i].b+q[i].a,ans%=mod,p+=ans,p%=mod;        printf("%I64d\n",p);    }    return 0;}