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.
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
5 1 2 2 3 3 4 4 5 5 6 0
Sample Output
1419HintIn 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.
题意: 有n 条队伍,给出a,b,,a 表示在0时刻排队花的时间,b表示别的队伍排队的时间是每一秒增加b,求得到最少的排队总时间。
思路:贪心。
一开始想的是将a×b从小到大排序,但是这种思想是错误的。
假设有2个队伍,(a1,b1)(a2,b2);
若第一个队伍先: ans = a1 + a1 * b2 + a2 = a1 + a2 + a1 * b2;
若第二个队伍先:ans = a2 + a2 * b1 + a1 = a1 + a2 + a2 * b1;
有两个公式可看出答案的决定因素是 a1 * b2 和 a2 * b1;
所以对结构体的a * b 进行排序即可。
而且应该注意的是数组名不能为time!
CODE :
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const int mod = 365*24*60*60;
struct node
{
ll a;
ll b;
}t[100005];
bool cmp(node x, node y)
{
return x.a * y.b < x.b * y.a;
}
int main()
{
//freopen("in", "r", stdin);
int n;
while(cin>>n){
if(n == 0) break;
for(int i = 0; i < n; ++i){
scanf("%lld %lld", &t[i].a, &t[i].b);
}
sort(t, t + n, cmp);
ll ans = t[0].a;
for(int i = 1; i < n; ++i){
ans = (ans + (ans * t[i].b + t[i].a)) % mod;
}
printf("%lld\n", ans);
}
return 0;
}