算法初步—贪心—A1070

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;

struct MoonCake
{
float num;           //月饼数量
float price,per;     //总价格，单价
}moon[1005];

bool cmp(MoonCake a,MoonCake b)
{
return a.per > b.per;
}

int main()
{
int N;
float D,profit = 0;
scanf("%d%f",&N,&D);
for(int i=0;i<N;i++)
scanf("%f",&moon[i].num);
for(int i=0;i<N;i++)
{
scanf("%f",&moon[i].price);
moon[i].per = moon[i].price / moon[i].num;  //计算每种月饼的单价
}
sort(moon,moon+N,cmp);
for(int i=0;i<N;i++)          //计算利润
{
if(D == 0)
break;
if(D > moon[i].num)
{
profit += moon[i].price;
D -= moon[i].num;
}
else
{
profit += moon[i].per * D;
D = 0;
}
}
printf("%.2f",profit);
return 0;
}