Mixing Milk

链接

分析:水题,按照价格从小到大排序,在进行贪心即可

/*
    PROB:milk
    ID:wanghan
    LANG:C++
*/
#include "iostream"
#include "cstdio"
#include "cstring"
#include "string"
#include "algorithm"
using namespace std;
const int maxn= 5000+10;
struct Node{
    int p,a;
};
Node h[maxn];
bool cmp(Node x,Node y){
    if(x.p==y.p)
        return x.a>y.a;
    return x.p<y.p;
}
int m;
long long n;
int main()
{
    freopen("milk.in", "r", stdin);
    freopen("milk.out", "w", stdout);
    cin>>n>>m;
    for(int i=0;i<m;i++)
        cin>>h[i].p>>h[i].a;
    sort(h,h+m,cmp);
    long long ans=0;
    int flag=0;
    /*if(n>=h[0].a){
        n-=h[0].a;
        ans+=(h[0].p*h[0].a);
        if(n==0) flag=1;
    }else{
        flag=1;
        ans+=(h[0].a-n)*h[0].p;
        //n=-1;
    }*/
    //cout<<ans<<endl;
    for(int i=0;i<m;i++){
        if(flag)  break;
        if(n>=h[i].a){
            n-=h[i].a;
            ans+=(h[i].a*h[i].p);
            if(n==0)  flag=1;
        }else{
            ans+=n*h[i].p;
            n=-1;
            flag=1;
        }
    }
    cout<<ans<<endl;
}

时间: 2024-10-24 12:30:58

Mixing Milk的相关文章

USACO 1.3 Mixing Milk(贪心)

USACO Mixing Milk 简单的贪心,读入数据,按单价从小到大排序,然后从最便宜的买起,直到买够为止. /* ID:twd30651 PROG:milk LANG:C++ */ #include<iostream> #include<fstream> #include<stdlib.h> using namespace std; int N; int M; typedef struct node { int P; int A; }node; node data

USACO 1.3 Mixing Milk

Mixing Milk The Merry Milk Makers company buys milk from farmers, packages it into attractive 1- and 2-Unit bottles, and then sells that milk to grocery stores so we can each start our day with delicious cereal and milk. Since milk packaging is such

Luogu P1208 [USACO1.3]混合牛奶 Mixing Milk(贪心)

P1208 [USACO1.3]混合牛奶 Mixing Milk 题目描述 由于乳制品产业利润很低,所以降低原材料(牛奶)价格就变得十分重要.帮助Marry乳业找到最优的牛奶采购方案. Marry乳业从一些奶农手中采购牛奶,并且每一位奶农为乳制品加工企业提供的价格是不同的.此外,就像每头奶牛每天只能挤出固定数量的奶,每位奶农每天能提供的牛奶数量是一定的.每天Marry乳业可以从奶农手中采购到小于或者等于奶农最大产量的整数数量的牛奶. 给出Marry乳业每天对牛奶的需求量,还有每位奶农提供的牛奶单

洛谷 P1208 [USACO1.3]混合牛奶 Mixing Milk

题目描述 由于乳制品产业利润很低,所以降低原材料(牛奶)价格就变得十分重要.帮助Marry乳业找到最优的牛奶采购方案. Marry乳业从一些奶农手中采购牛奶,并且每一位奶农为乳制品加工企业提供的价格是不同的.此外,就像每头奶牛每天只能挤出固定数量的奶,每位奶农每天能提供的牛奶数量是一定的.每天Marry乳业可以从奶农手中采购到小于或者等于奶农最大产量的整数数量的牛奶. 给出Marry乳业每天对牛奶的需求量,还有每位奶农提供的牛奶单价和产量.计算采购足够数量的牛奶所需的最小花费. 注:每天所有奶农

1.3.1 Mixing Milk

The Merry Milk Makers company buys milk from farmers, packages it into attractive 1- and 2-Unit bottles, and then sells that milk to grocery stores so we can each start our day with delicious cereal and milk. Since milk packaging is such a difficult

usaco Mixing Milk

发现我真的是很喜欢使用优先度咧 一个牛奶包装商人,从不同的奶农手里收购牛奶,以最低的价格买够每日所需,问最少花多少钱.直接贪心, /* ID: modengd1 PROG: milk LANG: C++ */ #include <iostream> #include <stdio.h> #include <queue> struct node { int P; int A; node(int p,int a) { A=a; P=p; } node(){} bool fr

USACO Section1.3 Mixing Milk 解题报告

milk解题报告 —— icedream61 博客园(转载请注明出处)------------------------------------------------------------------------------------------------------------------------------------------------[题目] 我是牛奶制造商,我一天需要N加仑的牛奶,总共有M个农民可以供给我. 这M个农民的信息共M行,第i个农民有num[i]加仑牛奶,每加仑

【贪心】Mixing Milk

题目描述 The Merry Milk Makers company buys milk from farmers, packages it into attractive 1- and 2-Unit bottles, and then sells that milk to grocery stores so we can each start our day with delicious cereal and milk.Since milk packaging is such a diffic

HOJX 1003| Mixing Milk

Problem Description Since milk packaging is such a low margin business, it is important to keep the price of the raw product (milk) as low as possible. Help Merry Milk Makers get the milk they need in the cheapest possible manner. The Merry Milk Make