翻译（（（

OpenJudge - 2393:Yogurt factory

2393:Yogurt factory

描述

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.

输入

* 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.

输出

* 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.

描述

奶牛们购买了一家酸奶厂，生产世界闻名的美味酸奶。在接下来的N（1<=N<=10000）周内，牛奶和劳动力的价格将每周波动，因此公司在第一周生产一单位酸奶将花费C_i（1<=C_i<=5000）美分。Yucky的工厂设计精良，每周可以生产任意多单位酸奶。
Jacky酸奶公司拥有一个仓库，可以储存未使用的酸奶，每周每单位酸奶的固定费用为S（1<=S<=100）美分。幸运的是，酸奶不会变质。Jacky酸奶的仓库很大，所以它可以任意存放很多单位的酸奶。
Yucky想找到一种方法，每周向客户交付Y_i（0<=Y_i<=10000）单位的酸奶（Y_i是第一周的交付量）。帮助Jacky在整个N周内将成本降至最低。第一周生产的酸奶，以及任何已经储存的酸奶，都可以用来满足那个星期的需求。

输入

*第1行：两个空格分隔的整数，N和S。
*第2行..N+1：行i+1包含两个空格分隔的整数：C_i和Y_i。

输出

*第1行：第1行包含一个整数：满足酸奶计划的最小总成本。请注意，对于32比特整数来说，总数可能太大。