#include<bits/stdc++.h>
using namespace std;
struct node
{
double liang;
double danjia;
double zong;
}p[1111];
bool cmp(node a,node b)
{
return tie(a.danjia)>tie(b.danjia);
}
int main()
{
int n,x;
cin>>n>>x;
for(int i=0;i<n;i++)
{
cin>>p[i].liang;
}
for(int i=0;i<n;i++)
{
cin>>p[i].zong;
}
for(int i=0;i<n;i++)
{
p[i].danjia=p[i].zong/p[i].liang;
}
sort(p,p+n,cmp);
double sum;
for(int i=0;i<n;i++)
{
if(p[i].liang<=x)
{
sum+=p[i].zong;
x-=p[i].liang;
}
else
{
sum+=p[i].danjia*x;
break;
}
}
printf("%.2f",sum);
}
L2-003 月饼 (25 分)
最新推荐文章于 2024-05-26 22:04:55 发布