【算法】Yogurt factory-贪心

最新推荐文章于 2024-11-06 11:05:01 发布

LTC0316

最新推荐文章于 2024-11-06 11:05:01 发布

阅读量103

点赞数

分类专栏：数据结构与算法文章标签：算法 c++ 开发语言

本文链接：https://blog.csdn.net/qq_43062936/article/details/127684317

版权

数据结构与算法专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Yogurt factory

总时间限制: 1000ms 内存限制: 65536kB
描述
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.
样例输入
4 5
88 200
89 400
97 300
91 500
样例输出
126900
提示
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.

#include <vector>
#include <iostream>

using namespace std;

int findMin(vector<int> &array);

int main()
{
    int N, S;
    cin >> N >> S;
    vector<int> cost_solid;
    vector<int> demand_array;
    for (int i = 0; i < N; ++i)
    {
        int cost;
        cin >> cost;
        int demand;
        cin >> demand;
        cost_solid.push_back(cost);
        demand_array.push_back(demand);
    }
    long long int sum = 0;
    int min=cost_solid[0];
    for (int i = 0; i < N; ++i)
    {
        min = (min + S) > cost_solid[i] ? cost_solid[i] : (min + S);
        sum += demand_array[i] * min;
    }
    cout << sum;
}