codeforces 782B Round #403 Div. 2B

B. The Meeting Place Cannot Be Changed

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction.

At some points on the road there are n friends, and i-th of them is standing at the point xi meters and can move with any speed no greater than vi meters per second in any of the two directions along the road: south or north.

You are to compute the minimum time needed to gather all the n friends at some point on the road. Note that the point they meet at doesn't need to have integer coordinate.

Input

The first line contains single integer n (2 ≤ n ≤ 60 000) — the number of friends.

The second line contains n integers x1, x2, ..., xn (1 ≤ xi ≤ 109) — the current coordinates of the friends, in meters.

The third line contains n integers v1, v2, ..., vn (1 ≤ vi ≤ 109) — the maximum speeds of the friends, in meters per second.

Output

Print the minimum time (in seconds) needed for all the n friends to meet at some point on the road.

Your answer will be considered correct, if its absolute or relative error isn't greater than 10 - 6. Formally, let your answer be a, while jury's answer be b. Your answer will be considered correct if  holds.

Examples

input

3
7 1 3
1 2 1

output

2.000000000000

input

4
5 10 3 2
2 3 2 4

output

1.400000000000

Note

In the first sample, all friends can gather at the point 5 within 2 seconds. In order to achieve this, the first friend should go south all the time at his maximum speed, while the second and the third friends should go north at their maximum speeds.

本题大意，在一条直线上有若干个点，对于每个点有一个最大移动速度，现在要找一个点，将所有点移动到这个点的位置，求最小的时间。

本题时限给了5s，一开始写了n^2的暴力，T了12，最后改用二分，二分距离，找到最后要到的点，然后对于每个点求出时间的最大值即可。

#include <iostream>
#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
double eps=1e-6;
int n;
struct fri
{
    double a,b;
}f[60005];
double ans;

bool cmp(fri a,fri b)
{
    return a.a<b.a;
}

double rf(double l,double r)
{
    if(r-l<eps){
        return l;
    }
    double mid=(l+r)/2;
    double maxl=0,maxr=0;
    for(int i=0;i<n;i++)
    {
        if(f[i].a<mid)
        {
            double now=fabs(f[i].a-mid)/f[i].b;
            if(now>maxl){
                ans=now;
                maxl=now;
            }
        }
        else
        {
            double now=fabs(f[i].a-mid)/f[i].b;
            if(now>maxr){
                ans=now;
                maxr=now;
            }
        }
    }
    if(maxl>maxr)
        return rf(l,mid);
    else
        return rf(mid+eps,r);
}

int main()
{
    //double a[6005],b[6005];
    //int n;
    cin>>n;
    double l,r;
    for(int i=0;i<n;i++)
        scanf("%lf",&f[i].a);
    for(int i=0;i<n;i++)
        scanf("%lf",&f[i].b);
    //double ans=0;
    double late;
    sort(f,f+n,cmp);
    l=f[0].a;
    r=f[n-1].a;
    //cout<<l<<r<<endl;
    late=rf(l,r);
    printf("%.12f",ans);
    //cout << "Hello world!" << endl;
    return 0;
}