pat 1070Mooncake (25)

最新推荐文章于 2024-07-27 01:25:42 发布

cwzhsi

最新推荐文章于 2024-07-27 01:25:42 发布

阅读量465

点赞数

分类专栏： c++算法文章标签： pat c++ 贪心

本文链接：https://blog.csdn.net/cwzhsi/article/details/40344629

版权

c++算法专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;

struct moon
{
double amounts;
double price;
double value;
}mooncake[1005];

bool cmp(const struct moon &a,const struct moon &b)//注意这里的写法
{

return a.value>b.value;
}

int main()
{
int n,demands;
int i,k;
double profit;
cin>>n>>demands;
for(i=1;i<=n;i++)
{
cin>>mooncake[i].amounts;
}
for(i=1;i<=n;i++)
{
cin>>mooncake[i].price;
mooncake[i].value=mooncake[i].price/mooncake[i].amounts;
}

sort(mooncake+1,mooncake+n+1,cmp);

profit=0.0;
for(i=1;i<=n;i++)
{
if(demands<=0)break;
if(demands>mooncake[i].amounts)
{
profit+=mooncake[i].price;
demands-=mooncake[i].amounts;
}
else
{
profit+=demands*mooncake[i].value;
demands-=demands;
}
}
cout<<fixed<<setprecision(2)<<profit<<endl;
system("pause");
return 0;
}