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

int n,sum;

struct node{
	double kucun;
	double zongjia;
	double danjia;
	
	friend bool operator<(node x,node y)
	{
		return x.danjia<y.danjia;
	}
};

node moon[1005];

int main()
{
	cin>>n>>sum	;
	for(int i=0;i<n;i++)cin>>moon[i].kucun;
	for(int i=0;i<n;i++)
	{
		cin>>moon[i].zongjia;
		moon[i].danjia=moon[i].zongjia*1.0/moon[i].kucun;
	}
	
	sort(moon,moon+n);
	
	double ans=0;
	
	for(int i=n;i>=0;i--)
	{
		if(moon[i].kucun>=sum)
		{
			ans+=moon[i].danjia*sum;
			break;
		}
		else
		{
			ans+=moon[i].zongjia;
			sum-=moon[i].kucun;
		}
		
	}
	
	printf("%.2f",ans);
	
	return 0;
 }