USACO月赛题解整理-集训Day2

1.★☆☆☆☆ 酸奶工厂

Yogurt factory, 2005 Mar
加上维护费用，计算出实际成本然后贪心。
本题要注意long long

const int maxn = 10010;
ll c[maxn], a[maxn], d, n;
int main()
{
    scanf("%lld%lld", &n, &d);
    rep(i, n) scanf("%lld%lld", &c[i], &a[i]);
    ll now = 10010, ans = 0;
    rep(i, n){
        now = min(now + d, c[i]);
        ans += now * a[i];
    }
    printf("%lld\n", ans);
    return 0;
}

2.★☆☆☆☆ 购买饲料

Buying Feed II, 2010 Jan

计算出加上油价后的实际价格，按照从小到大的顺序进行购买。

const int maxn = 10010;
struct node{
    int x, f, c, p;
    node(int _x = 0, int _f = 0, int _c = 0) : x(_x), f(_f), c(_c) {}
};
node a[maxn];
int cmp(node x, node y){
    return x.p < y.p;
}
int k, e, n;
int main()
{
    scanf("%d