HDU 4442 Physical Examination(关于贪心排序)

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long ll;
const int maxn = 100010;
const ll mod = 365 * 24 * 60 * 60;
struct Node {
    ll a, b;
    bool operator < (const Node &node) const {
        return a * node.b < b * node.a;
    }
}ary[maxn];
int main()
{
    int n;
    while (~scanf("%d", &n) && n)
    {
        for (int i = 0; i < n; i++)
            scanf("%lld %lld", &ary[i].a, &ary[i].b);
        sort(ary, ary + n);
        ll ans = 0;
        for (int i = 0; i < n; i++)
            ans = (ans + ans * ary[i].b + ary[i].a) % mod;
        printf("%lld\n", ans);
    }

    return 0;
}