zoukankan      html  css  js  c++  java
  • 1070 Mooncake (25 分) 贪心

    Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region's culture. Now given the inventory amounts and the prices of all kinds of the mooncakes, together with the maximum total demand of the market, you are supposed to tell the maximum profit that can be made.

    Note: partial inventory storage can be taken. The sample shows the following situation: given three kinds of mooncakes with inventory amounts being 180, 150, and 100 thousand tons, and the prices being 7.5, 7.2, and 4.5 billion yuans. If the market demand can be at most 200 thousand tons, the best we can do is to sell 150 thousand tons of the second kind of mooncake, and 50 thousand tons of the third kind. Hence the total profit is 7.2 + 4.5/2 = 9.45 (billion yuans).

    Input Specification:

    Each input file contains one test case. For each case, the first line contains 2 positive integers N (≤), the number of different kinds of mooncakes, and D (≤ thousand tons), the maximum total demand of the market. Then the second line gives the positive inventory amounts (in thousand tons), and the third line gives the positive prices (in billion yuans) of N kinds of mooncakes. All the numbers in a line are separated by a space.

    Output Specification:

    For each test case, print the maximum profit (in billion yuans) in one line, accurate up to 2 decimal places.

    Sample Input:

    3 200
    180 150 100
    7.5 7.2 4.5
     

    Sample Output:

    9.45



    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1010;
    struct M{
        double inv;
        double allpri;
        double price;
    }m[maxn];
    bool cmp(M a,M b){
        return a.price>b.price;
    }
    int main(){
        int n,dem;
        scanf("%d %d",&n,&dem);
        for(int i=0;i<n;i++){
            scanf("%lf",&m[i].inv);
        }
        for(int i=0;i<n;i++){
            scanf("%lf",&m[i].allpri);
            m[i].price=m[i].allpri/m[i].inv;
        }
        sort(m,m+n,cmp);
        double ans=0;
        for(int i=0;i<n;i++){
            if(m[i].inv<=dem){
                dem-=m[i].inv;
                ans+=m[i].allpri;
            }
            else{
                ans+=(m[i].price*dem);
                dem-=dem;
                break;
            }
        }
        printf("%.2f
    ",ans);
        return 0;
    }
  • 相关阅读:
    [转]怎么把一个textview的背景图片设置成圆角的?
    [转]android 自定义圆形imageview控件
    [转]Android网格视图(GridView)
    简单研究Android View绘制二 LayoutParams
    简单研究Android View绘制一 测量过程
    优雅的处理Android数据库升级的问题
    DownloadManager补漏
    [转载]一个简单的内存缓存实现--一段漂亮的代码
    Java设计模式系列3--抽象工厂模式(Abstract Factory Method)
    Java设计模式系列2--工厂方法模式(Factory Method)
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14487112.html
Copyright © 2011-2022 走看看