func_code_string: #include <bits/stdc++.h>   using namespace std;   long long int a[200005], b[200005], c[200005];   class Myfirst {    private:     string *name;     long long int *age;       public:     long long int gcd(long long int a, long long int b) {       if (b == 0) return a;       a %= b;       return gcd(b, a);     }     long long int exte_gcd(long long int a, long long int b, long long int &x,                            long long int &y) {       if (b == 0) {         x = 1;         y = 0;         return a;       }       long long int x1, y1;       long long int d = exte_gcd(b, a % b, x1, y1);       x = y1;       y = x1 - y1 * (a / b);       return d;     }     long long int powe(long long int d, long long int s) {       if (s == 1)         return d;       else if (s == 0)         return 1;       else {         long long int u, v = d;         for (u = 1; u < s; u++) d = d * v;         return d;       }     }     long long int count_divisors(long long int b) {       long long int i, count = 0, n = 1;       for (i = 2; i * i <= b; i++) {         count = 0;         if (b % i == 0) {           while (b % i == 0) {             b = b / i;             count++;           }           n = n * (count + 1);         }       }       if (b > 1) n = 2 * n;       return n;     }     long long int bigmod(long long int a, long long int b, long long int mod) {       if (b == 0) return 1;       long long int x = bigmod(a, b / 2, mod);       x = (x * x) % mod;       if (b % 2) x = (x * a) % mod;       return x;     }     long long int phi(long long int n) {       double result = n;       for (long long int p = 2; p * p <= n; ++p) {         if (n % p == 0) {           while (n % p == 0) n /= p;           result *= (1.0 - (1.0 / (double)p));         }       }       if (n > 1) result *= (1.0 - (1.0 / (double)n));       return (long long int)result;     }     void solve() {       long long int t;       t = 1;       while (t--) {         long long int n, m, k, i, j, A, B;         cin >> n;         for (i = 1; i <= n; i++) cin >> a[i];         cin >> m;         for (i = 1; i <= m; i++) cin >> b[i];         cin >> k;         for (i = 1; i <= k; i++) cin >> c[i];         cin >> A >> B;         sort(a + 1, a + n + 1);         sort(b + 1, b + m + 1);         sort(c + 1, c + k + 1);         double ans;         ans = ((c[1] * 1.0) / b[m]) * ((A * 1.0) / B);         ans += 1.0;         ans = sqrt(1.0 / ans);         cout << setprecision(10);         cout << ans * a[n];       }     }   };   int main() {     Myfirst *prg = new Myfirst();     prg->solve();   }   