#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct mooncake{
double num;
double m;
double p; //单位重量上价值量最大的;
bool operator < (const mooncake &a) const{
return p>a.p;
}
}m[1001];
int main(int argc, char** argv) {
int n;
double w;
scanf("%d %lf",&n,&w);
for(int i=0;i<n;i++) scanf("%lf",&m[i].num);
for(int i=0;i<n;i++){
scanf("%lf",&m[i].m); m[i].p=m[i].p/m[i].num;
}
sort(m,m+n);
double ans=0;
int index=0;
while(index!=n && w){
if(w>=m[index].num){
ans+=m[index].m;
w-=m[index].num;
}
else{
ans+=w*m[index].p; //这个表达式有问题;
w=0;
}
index++;
}
printf("%0.2f",ans);
return 0;
}
#include <cstdio>
#include <algorithm>
using namespace std;
struct mooncake{
double num;
double m;
double p; //单位重量上价值量最大的;
bool operator < (const mooncake &a) const{
return p>a.p;
}
}m[1001];
int main(int argc, char** argv) {
int n;
double w;
scanf("%d %lf",&n,&w);
for(int i=0;i<n;i++) scanf("%lf",&m[i].num);
for(int i=0;i<n;i++){
scanf("%lf",&m[i].m); m[i].p=m[i].p/m[i].num;
}
sort(m,m+n);
double ans=0;
int index=0;
while(index!=n && w){
if(w>=m[index].num){
ans+=m[index].m;
w-=m[index].num;
}
else{
ans+=w*m[index].p; //这个表达式有问题;
w=0;
}
index++;
}
printf("%0.2f",ans);
return 0;
}