#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
struct yue{
  double inventory;
  double  price;
  double profit;
  }y[1000];
bool cmp(yue a,yue b){
  return a.profit>b.profit;
}
int main(int argc, char *argv[])
{
  int n,m;
  cin>>n>>m;
  for
 
(int i=0;i<n;i++){
    cin>>y[i].inventory;
  }
  for(int i=0;i<n;i++){
    cin>>y[i].price;
  }
  for(int i=0;i<n;i++){
    y[i].profit=(y[i].price*1.0)/y[i].inventory;
  }
  sort(y,y+n,cmp);
  
  double sum=0;
  for(int i=0;i<n;i++){
    if(m>0){
    if(m<=y[i].inventory)
       sum=sum+m*y[i].profit;
       
      else
 

         sum=sum+y[i].profit*y[i].inventory;
         m=m-y[i].inventory;
    }
    
  }
  printf("%.2lf",sum);
  return 0;
}