题目:click here~
题意:WANGPENG排队体检,共n个项目,对于第i个项目,完成该项目要ai的时间,若不在队列中,每过1秒需要等bi秒,问他完成所有项目的最短时间。
#pragma warning (disable:4996)
#include <iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
using namespace std;
const int MOD = 365 * 24 * 60 * 60;
struct Node
{
long long a, b;
bool operator < (const Node& x) const
{
return a*x.b < b*x.a;
}
};
Node node[10010];
int main()
{
int n;
while (cin >> n&&n)
{
for (int i = 0; i < n; i++)
{
scanf("%lld %lld", &node[i].a, &node[i].b);
}
sort(node, node+ n);
long long ans = node[0].a%MOD;
for (int i = 1; i < n; i++)
{
ans = (ans + ans*node[i].b + node[i].a) % MOD;
}
ans = ans % MOD;
printf("%lld\n", ans);
}
return 0;
}