PAT | A1070 Mooncake

最新推荐文章于 2024-09-14 13:16:14 发布

睡不着kkk

最新推荐文章于 2024-09-14 13:16:14 发布

阅读量62

点赞数

分类专栏： PTA 文章标签： c++

本文链接：https://blog.csdn.net/yehonglin29/article/details/104859210

版权

PTA 专栏收录该内容

136 篇文章 0 订阅

订阅专栏

很简单的贪心，算出每种月饼的单价，递减排序后，从左往右加

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Mooncake{
	double inventory;
	double price;
	double pricePerTTon;
};

bool cmp(Mooncake a,Mooncake b){
	return a.pricePerTTon > b.pricePerTTon;
}

vector<Mooncake> mooncakes;

int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	for(int i = 0;i < n;i++){
		Mooncake temp;
		scanf("%lf",&temp.inventory);
		mooncakes.push_back(temp);
	}
	for(int i = 0;i < n;i++){
		scanf("%lf",&mooncakes[i].price);
		mooncakes[i].pricePerTTon = mooncakes[i].price / mooncakes[i].inventory;
	}
	sort(mooncakes.begin(),mooncakes.end(),cmp);
	int i = 0;
	double sum = 0;
	while(m != 0 && i < n){
		if(m >= mooncakes[i].inventory){
			sum += mooncakes[i].price;
			m = m - mooncakes[i].inventory;
			i++;
		}else{
			sum += m * mooncakes[i].pricePerTTon;
			m = 0;
		}
	}
	printf("%.2lf",sum);
	system("pause");
	return 0;
}