【PAT】【Advanced Level】1070. Mooncake (25)
来源:互联网 发布:金数据 - 登录 编辑:程序博客网 时间:2024/06/05 20:10
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 200180 150 1007.5 7.2 4.5Sample Output:
9.45
https://www.patest.cn/contests/pat-a-practise/1070
https://www.nowcoder.com/pat/5/problem/4031
思路:
结构体排序
坑点:
数量有可能不是整数。。
CODE:
#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#define N 1010using namespace std;typedef struct S{float v;float w;};S cake[N];bool cmp(S a,S b){float aa=(float)a.v/(float)a.w;float bb=(float)b.v/(float)b.w;return aa>bb;}int main(){int n,m;cin>>n>>m;for(int i=0;i<n;i++){cin>>cake[i].w;}for(int i=0;i<n;i++){cin>>cake[i].v;}sort(cake,cake+n,cmp);float re=0;for (int i=0;i<n;i++){if (cake[i].w<=m){re+=(float)cake[i].v;m-=cake[i].w;}else{re+=( ((float)cake[i].v/(float)cake[i].w) * (float)m);break;}}printf("%.2f",re);return 0;}
- 【PAT】【Advanced Level】1070. Mooncake (25)
- PAT (Advanced Level) 1070. Mooncake (25) 结构体排序
- 1070. Mooncake (25)【贪心】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- PAT (Advanced) 1070. Mooncake (25)
- Pat(Advanced Level)Practice--1070(Mooncake)
- 【PAT】1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- pat 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT A 1070. Mooncake (25)
- ZJU-PAT 1070. Mooncake (25)
- PAT(A) - 1070. Mooncake (25)
- PAT甲级1070. Mooncake (25)
- 并查集
- 剑指offer 算法题 python版 更新中
- 前端分享插件
- 笔试题积累
- 欢迎使用CSDN-markdown编辑器
- 【PAT】【Advanced Level】1070. Mooncake (25)
- tcl语法
- java之String不可变思考
- SpringMVC(一)HelloWorld
- toolbar 总结和踩过的坑 , 为toolbar设置字体
- js实现map
- 安卓Socket使用之客户端
- UGUI button加监听方法、带参数与不带参数
- MATLAB利用散点进行函数曲线拟合