二分贪心练习题-Y25

最新推荐文章于 2021-03-22 22:18:34 发布

snayf

最新推荐文章于 2021-03-22 22:18:34 发布

阅读量239

点赞数

本文链接：https://blog.csdn.net/snayf/article/details/71375614

版权


  
  
   
   
    
    
     
     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
   
   
 
 
题意：

    工厂生产奶酪，每天都有定额上交，每天的生产成本都不同，完成生产量，但明天的上交量可以在今天生产好保存，但保存要耗费成本，试计算法，求怎样安排生产最省钱。

思路：

    就是要比较今天要生产的单价在与在今天之前生产的单价累加保存天数作比较，选小的数累加计算花费；

    其实就是贪心做的

#include <iostream>
#include <algorithm>
#include<stdio.h>
#include<vector>
#include<string.h>
#include<string>
using namespace std;
int main()
{
    long long cos=0,p=999999,s,n,a,b;
    cin>>n>>s;
    for(int i=0;i<n;i++)
    {
        cin>>a>>b;
        p=min(a,p+s);//比较今天的任务是今天生产还是昨天（或更早）生产
        cos=cos+p*b;
    }
    cout<<cos;
}