zoukankan      html  css  js  c++  java
  • USACO 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 wants 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  
    /*
    ID: jun41821
    PROG: milk
    LANG: C++
    */
    #include <iostream>
    #include <fstream>
    #include <algorithm>
    using namespace std;
    ofstream fout ("milk.out");
    ifstream fin ("milk.in");
    struct milk{
    int x;
    int y;
    }m[5002];
    int cmp(const void *a,const void *b)               //排序
    {
        struct milk *c=(milk*)a;
        struct milk *d=(milk*)b;
        return c->x-d->x;                   //对x排序
    }
    int main()
    {
        int i,N,M,sump=0,sumn=0;
        fin>>N>>M;                  //输入
        for(i=0;i<M;i++)
            fin>>m[i].x>>m[i].y;            //利用结构体排序
        //结构体排序
        qsort(m,M,sizeof(m[0]),cmp);
        for(i=0;i<M;i++)
            cout<<m[i].x<<' '<<m[i].y<<endl;            //利用结构体排序
        for(i=0;i<M&&sumn<=N;i++)
            if(sumn+m[i].y<=N)
            {
                sump+=m[i].x*m[i].y;
                sumn+=m[i].y;
            }
            else
            {
                sump+=m[i].x*(N-sumn);
                fout<<sump<<endl;
                return 0;
            }
            fout<<sump<<endl;
        return 0;
    }
  • 相关阅读:
    带字数限制提示的输入框效果
    js快速获取数组中的最大值最小值
    js实现连线题
    js自定义图片提示效果
    为了遇见你
    为了明天(励志篇)
    你为什么总是不理我
    爱情,是我一生中最虔诚的信仰
    你是我心中永远抹不掉的痛
    爱你一万次够不够
  • 原文地址:https://www.cnblogs.com/amourjun/p/5134202.html
Copyright © 2011-2022 走看看