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 (<=1000), the number of different kinds of mooncakes, and D (<=500 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

    注意点:月亮的总数是double型的不是int型的
     1 #include<iostream>
     2 #include<vector>
     3 #include<algorithm>
     4 using namespace std;
     5 struct node{
     6   double amout, total, price;
     7 };
     8 bool cmp(node a, node b){return a.price>b.price;}
     9 int main(){
    10   int n,  i;
    11   double maxx;
    12   cin>>n>>maxx;
    13   vector<node> v(n);
    14   for(i=0; i<n; i++) scanf("%lf", &v[i].amout);
    15   for(i=0; i<n; i++) { scanf("%lf", &v[i].total); v[i].price = v[i].total/v[i].amout;}
    16   sort(v.begin(), v.end(), cmp);
    17   double total=0.0;
    18   for(i=0; i<n; i++){
    19     if(v[i].amout<maxx){
    20       total += v[i].total;
    21       maxx -= v[i].amout;
    22     }else{
    23       total += v[i].price*maxx;
    24       break;
    25     }
    26   }
    27   printf("%.2f", total);
    28   return 0;
    29 }
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    ffmpeg基础 -- avio_alloc_context 读内存
    C++入门--运算符重载
    驻极体话筒与MEMS话筒
    gdb调试段错误
    从零开始学Axure原型设计(高级篇)
    从零开始学Axure原型设计(进阶篇)
    从零开始学Axure原型设计(入门篇)
    自学编程的人,都是怎么找到自己的第一份工作的
    做一名程序员需要学哪些知识
    微信web开发者工具
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9174720.html
Copyright © 2011-2022 走看看