PAT (Advanced Level) Practise 1070 Mooncake (25)
来源:互联网 发布:vue.js是什 编辑:程序博客网 时间:2024/05/20 16:11
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
简单贪心
#include<cstdio>#include<queue>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int maxn =1e5 + 10;int n;double m;struct point{ double x,y; bool operator<(const point&a)const { return y/x>a.y/a.x; }}a[maxn];int main(){ scanf("%d%lf", &n,&m); for (int i=0;i<n;i++) scanf("%lf",&a[i].x); for (int i=0;i<n;i++) scanf("%lf",&a[i].y); sort(a,a+n); double ans=0; for (int i=0;i<n;i++) { if (a[i].x<=m) {ans+=a[i].y; m-=a[i].x;} else { ans+=a[i].y/a[i].x*m; break; } } printf("%.2lf\n",ans); return 0;}
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- 1070. Mooncake (25)【贪心】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1070
- Pat(Advanced Level)Practice--1070(Mooncake)
- 【PAT】【Advanced Level】1070. Mooncake (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- 1029. Median (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1032. Sharing (25)
- Stanford CoreNLP – a suite of core NLP tools
- 258. Add Digits
- java中>,>>,>>> 的区别
- OpenGL Vertex Array
- python 中*args和**kw详解
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- 关于人之理解
- 自定义实现ArrayList
- 一道看似很简单的题目,竟然让很多人丢了分
- Js数组组合输出
- 查找与排序之冒泡排序篇(C语言实现)
- Java --- 异常处理和设计
- spring AOP 两种底层实现( JDK动态代理 和 CGLIB代理)
- OpenStack自动化部署----单节点的自动安装(DevStack)+apt-get更换源