# poj 2393 && bzoj 1680: [Usaco2005 Mar]Yogurt factory（贪心）

## 1680: [Usaco2005 Mar]Yogurt factory

Time Limit: 5 Sec   Memory Limit: 64 MB
Submit: 311   Solved: 228
[ Submit][ Status][ Discuss]

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

• 第一行：两个整数 N 和 S，1 ≤ N ≤ 10000, 1 ≤ S ≤ 100• 第二行到第 N + 1 行：第 i + 1 行有两个整数 Ci 和 Ai，1 ≤ Ci ≤ 5000, 1 ≤ Ai ≤ 10000

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

• 单个整数：表示生产酸奶的最小总费用

4 5
88 200
89 400
97 300
91 500

## Sample Output

126900

#include<stdio.h>
#include<algorithm>
using namespace std;
#define LL long long
int a[10005], b[10005];
int main(void)
{
LL sum;
int i, n, m, temp;
scanf("%d%d", &n, &m);
for(i=1;i<=n;i++)
scanf("%d%d", &a[i], &b[i]);
sum = a[1]*b[1];
temp = a[1];
for(i=2;i<=n;i++)
{
temp += m;
sum += min(temp, a[i])*b[i];
temp = min(temp, a[i]);
}
printf("%lld\n", sum);
return 0;
}

• 2
点赞
• 0
评论
• 1
收藏
• 一键三连
• 扫一扫，分享海报

02-25 428

07-08 616
03-21 4402
10-24 1259
11-17 971
07-03 1189
05-03 364
09-27 1408
09-02 993
03-31 991
01-09 885
04-04 564
07-26 845
04-01 2742
04-19 1838
02-23 371
01-08 1566

Jaihk662

¥2 ¥4 ¥6 ¥10 ¥20