USACO 1.3 Mixing Milk (milk)

最新推荐文章于 2022-09-26 20:49:00 发布

DamonHao

最新推荐文章于 2022-09-26 20:49:00 发布

阅读量870

点赞数

CC 4.0 BY-SA版权

分类专栏： USACO USACO 题解文章标签： Algorithm

本文链接：https://blog.youkuaiyun.com/damonhao/article/details/19484881

USACO 同时被 2 个专栏收录

64 篇文章

订阅专栏

USACO 题解

64 篇文章

订阅专栏

本文介绍了一个用于计算最优牛奶购买成本的算法。通过读取输入文件中的需求量与多个供应商的价格及供应量信息，该算法采用C++实现，按价格升序排序后逐个选择供应商直至满足总需求，最终输出最小化成本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
ID: haolink1
PROG: milk
LANG: C++
*/

//#include <iostream>
#include <fstream>
#include <list>
using namespace std;

class Milk{
public:
    int price_;
    int amount_;
    Milk(int price, int amount):
        price_(price),amount_(amount){}
    Milk(const Milk& milk){
        price_ = milk.price_;
        amount_ = milk.amount_;
    }
    ~Milk(){}
};

bool ComparePrice(const Milk& milk1,const Milk& milk2){
    if(milk1.price_ <= milk2.price_)
        return true;
    return false;
}

int main(){
    ifstream fin("milk.in");
    int demand = 0;
    int farmer_num = 0;
    fin >> demand;
    fin >> farmer_num;
    list<Milk> milks;
    int price = 0;
    int amount = 0;
    for(int i = 0; i < farmer_num; i++){
        fin >> price;fin >> amount;
        Milk milk(price,amount);
        milks.push_back(milk);
    }
    // sort the milk price in ascending order
    milks.sort(ComparePrice);
    int cost = 0;
    for(list<Milk>::iterator it = milks.begin(); it != milks.end(); it++){ 
        int remainder =  demand - it->amount_;
        if(remainder > 0){
            cost += it->price_ * it->amount_; 
            demand = remainder;
        }else if(remainder == 0){
            cost += it->price_ * it->amount_; 
            break;
        }else{
            cost += it->price_ * demand;
            break;
        }
    }
    ofstream fout("milk.out");
    fout << cost <<endl;
}