POJ 2393 Yogurt factory 【贪心 水】

Yogurt factory

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8074		Accepted: 4130

Description

The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of yogurt in week i. Yucky's factory, being well-designed, can produce arbitrarily many units of yogurt each week. 

Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Fortuitously, yogurt does not spoil. Yucky Yogurt's warehouse is enormous, so it can hold arbitrarily many units of yogurt. 

Yucky wants to find a way to make weekly deliveries of Y_i (0 <= Y_i <= 10,000) units of yogurt to its clientele (Y_i is the delivery quantity in week i). Help Yucky minimize its costs over the entire N-week period. Yogurt produced in week i, as well as any yogurt already in storage, can be used to meet Yucky's demand for that week.

Input

* Line 1: Two space-separated integers, N and S. 

* Lines 2..N+1: Line i+1 contains two space-separated integers: C_i and Y_i.

Output

* Line 1: Line 1 contains a single integer: the minimum total cost to satisfy the yogurt schedule. Note that the total might be too large for a 32-bit integer.

Sample Input

4 5
88 200
89 400
97 300
91 500

Sample Output

126900

Hint

OUTPUT DETAILS: 
In week 1, produce 200 units of yogurt and deliver all of it. In week 2, produce 700 units: deliver 400 units while storing 300 units. In week 3, deliver the 300 units that were stored. In week 4, produce and deliver 500 units. 

恩，题目大意就是说，酸奶生产的成本每周有波动，酸奶可以无限期储存，仓库无限大，用仓库每周储存一单位的酸奶花费S问最小花费。恩，long long 就WA  __int64 才过

#include <iostream>
#include<cstdio>
#include<cstring>
#define maxn 10010
#define LL long long
using namespace std;
struct node
{
    int p,v;
};
node milk[maxn];
__int64 sum;
int main()
{
    int n,s;
    while(~scanf("%d%d",&n,&s))
    {
        sum=0;
        for(int i=1;i<=n;++i)
            scanf("%d%d",&milk[i].p,&milk[i].v);
        for(int i=1;i<=n;++i)
        {
            int tem=milk[i].p;
            for(int j=1;j<=i;++j)
            {
                if(milk[j].p<milk[i].p)
                {
                    if(tem>milk[j].p+s*(i-j))
                        tem=milk[j].p+s*(i-j);
                }
            }
            sum+=tem*milk[i].v;
        }
        printf("%I64d\n",sum);
    }
    return 0;
}