zoukankan      html  css  js  c++  java
  • usaco 1.3.1 Mixing Milk

    Mixing Milk

    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 Makers company has several farmers from which they may buy milk, and each one has a (potentially) different price at which they sell to the milk packing plant. Moreover, as a cow can only produce so much milk a day, the farmers only have so much milk to sell per day. Each day, Merry Milk Makers can purchase an integral amount of milk from each farmer, less than or equal to the farmer's limit.

    Given the Merry Milk Makers' daily requirement of milk, along with the cost per gallon and amount of available milk for each farmer, calculate the minimum amount of money that it takes to fulfill the Merry Milk Makers' requirements.

    Note: The total milk produced per day by the farmers will be sufficient to meet the demands of the Merry Milk Makers.

    PROGRAM NAME: milk

    INPUT FORMAT

    Line 1: Two integers, N and M.
    The first value, N, (0 <= N <= 2,000,000) is the amount of milk that Merry Milk Makers' want per day. The second, M, (0 <= M <= 5,000) is the number of farmers that they may buy from.
    Lines 2 through M+1: The next M lines each contain two integers, Pi and Ai.
    Pi (0 <= Pi <= 1,000) is price in cents that farmer i charges.
    Ai (0 <= Ai <= 2,000,000) is the amount of milk that farmer i can sell to Merry Milk Makers per day.

    SAMPLE INPUT (file milk.in)

    100 5
    5 20
    9 40
    3 10
    8 80
    6 30
    

    OUTPUT FORMAT

    A single line with a single integer that is the minimum price that Merry Milk Makers can get their milk at for one day.

    SAMPLE OUTPUT (file milk.out)

    630
    
    View Code
    /*
    ID: qyxiang1
    PROG: milk
    LANG: C++
    */
    #include
    <fstream>
    #include
    <string>
    #include
    <iostream>
    #include
    <memory.h>
    #include
    <algorithm>
    using namespace std;

    ifstream fin(
    "milk.in");
    ofstream fout(
    "milk.out");
    bool cmp(int *a, int *b)
    {
    return a[0] < b[0];
    }

    int main()
    {
    long long int need, farmer;
    long long int pay=0;
    int i;
    fin
    >> need >> farmer;
    if(need == 0 || farmer == 0)
    {
    fout
    << 0 << endl;
    return 0;
    }
    int **ptr = new int *[farmer];
    for( i = 0; i < farmer; ++i)
    {
    ptr[i]
    = new int[2];
    fin
    >> ptr[i][0] >> ptr[i][1];
    }

    sort(ptr, ptr
    +farmer,cmp);

    for( i = 0; ptr[i][1] < need;++i)
    {
    pay
    += (ptr[i][0])*(ptr[i][1]);
    need
    -= ptr[i][1];
    }
    pay
    +=(ptr[i][0])*need;

    fout
    << pay << endl;
    return 0;
    }
    View Code
    /*
    ID: qyxiang1
    PROG: milk
    LANG: C++
    */
    #include
    <fstream>
    #include
    <string>
    #include
    <iostream>
    #include
    <memory.h>
    #include
    <algorithm>
    #include
    <stdlib.h>
    using namespace std;

    ifstream fin(
    "milk.in");
    ofstream fout(
    "milk.out");
    bool cmp(int *a, int *b)
    {
    return a[0] < b[0];
    }
    int main()
    {
    int need, farmer;
    unsigned
    int pay = 0;
    int i, j;
    int charge, amount;
    fin
    >> need >> farmer;
    if(need ==0 || farmer == 0)
    {
    fout
    << 0 << endl;
    return 0;
    }
    int price[1001] ;
    memset(price,
    0, sizeof(price));

    for(i = 0; i < farmer; i++)
    {
    fin
    >> charge >> amount;
    price[charge]
    += amount;
    }

    for( i = 0; price[i] < need;++i)
    {
    if(price[i]){
    pay
    += i*price[i];
    need
    -= price[i];}
    }

    pay
    += i*need;

    fout
    << pay << endl;
    return 0;
    }

  • 相关阅读:
    部署阿里云服务器流程小结
    爬虫中代理的设置问题介绍
    简析 __init__、__new__、__call__ 方法
    Python3.* 和Python2.*的区别
    解决k8s svcat ServiceInstance 删除不掉问题
    k8s dashboard部署,使用traefik暴露问题记录
    python中all函数得用法
    使用Hexo+github搭建个人博客大坑
    使用scrapy爬取百度招聘
    还是爬虫,使用的是selenium,爬取的是智联,爬取速度灰常慢...
  • 原文地址:https://www.cnblogs.com/cosmoseeker/p/usaco.html
Copyright © 2011-2022 走看看