#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************



vector<int> a; //* Val
vector<int> b; //* Wg

double consistency(int n, int x){
	
	vector<pair<int,int>> p;
	for(int i=0; i<n; i++){
		p.push_back({a[i], b[i]});
	}

	//* Sort by V/W basis decreasing order
    sort(begin(p), end(p), [](const pair<int,int>& a, const pair<int,int>& b){
        return a.first * b.second > b.first * a.second;
    });
    

    double ans = 0;
    
    for(int i=0; i<n; i++){
    	double v = p[i].first;
    	double w = p[i].second;
    	double rem = w;
    	
    	if(x-w < 0){
    		rem = x;
    	}
		
    	v = (rem/w) * v;
		x -= rem; 	
		ans += v;    	
    }



    return ans;    
}















double practice(int n, int x){


    return 0;
}





void solve() {
    
    int n, x;
    cin>> n >> x;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << fixed << setprecision(7) << consistency(n, x) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}