Limak is a big polar bear. He prepared n problems for an algorithmic contest. The i-th problem has initial score p i. Also, testers said that it takes t i minutes to solve the i-th problem. Problems aren’t necessarily sorted by difficulty and maybe harder problems have smaller initial score but it’s too late to change it — Limak has already announced initial scores for problems. Though it’s still possible to adjust the speed of losing points, denoted by c in this statement.
Let T denote the total number of minutes needed to solve all problems (so, T = t 1 + t 2 + … + t n). The contest will last exactly T minutes. So it’s just enough to solve all problems.
Points given for solving a problem decrease linearly. Solving the i-th problem after x minutes gives exactly 
points, where 
is some real constant that Limak must choose.
Let’s assume that c is fixed. During a contest a participant chooses some order in which he or she solves problems. There are n! possible orders and each of them gives some total number of points, not necessarily integer. We say that an order is optimal if it gives the maximum number of points. In other words, the total number of points given by this order is greater or equal than the number of points given by any other order. It’s obvious that there is at least one optimal order. However, there may be more than one optimal order.
Limak assumes that every participant will properly estimate t i at the very beginning and will choose some optimal order. He also assumes that testers correctly predicted time needed to solve each problem.
For two distinct problems i and j such that p i < p j Limak wouldn’t be happy to see a participant with strictly more points for problem i than for problem j. He calls such a situation a paradox.
It’s not hard to prove that there will be no paradox for c = 0. The situation may be worse for bigger c. What is the maximum real value c (remember that ) for which there is no paradox possible, that is, there will be no paradox for any optimal order of solving problems?
It can be proved that the answer (the maximum c as described) always exists.
Input
The first line contains one integer n (2 ≤ n ≤ 150 000) — the number of problems.
The second line contains n integers p 1, p 2, …, p n (1 ≤ p i ≤ 108) — initial scores.
The third line contains n integers t 1, t 2, …, t n (1 ≤ t i ≤ 108) where t i is the number of minutes needed to solve the i-th problem.
Output
Print one real value on a single line — the maximum value of c that and there is no optimal order with a paradox. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct if 
.
Examples
input
3
4 3 10
1 1 8
output
0.62500000000
input
4
7 20 15 10
7 20 15 10
output
0.31901840491
input
2
10 20
10 1
output
1.00000000000
Note
In the first sample, there are 3 problems. The first is (4, 1) (initial score is 4 and required time is 1 minute), the second problem is (3, 1) and the third one is (10, 8). The total time is T = 1 + 1 + 8 = 10.
Let’s show that there is a paradox for c = 0.7. Solving problems in order 1, 2, 3 turns out to give the best total score, equal to the sum of:
- solved 1 minute after the start:
- solved 2 minutes after the start:
- solved 10 minutes after the start:
So, this order gives 3.72 + 2.58 + 3 = 9.3 points in total and this is the only optimal order (you can calculate total scores for other 5 possible orders too see that they are lower). You should check points for problems 1 and 3 to see a paradox. There is 4 < 10 but 3.72 > 3. It turns out that there is no paradox for c = 0.625 but there is a paradox for any bigger c.
In the second sample, all 24 orders are optimal.
In the third sample, even for c = 1 there is no paradox.
Solution:
#include<stdio.h>
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<memory.h>
#include
<map>
#include<set>
#include<queue>
#include <list>
#include<sstream>
#include<cstring>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define SS stringstream
#define sqr(x) ((x)*(x))
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,63,sizeof(x))
#define CC(x) cout << (x) << endl
#define pw(x) (1ll<<(x))
#define buli(x) __builtin_popcountll(x)
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define M 1000000007
#define N 211111
#define TASK "1"
using namespace std;
typedef pair<int,int> pt;
int n;
pair<int, int> q[N];
bool my (pair<int, int> a, pair<int, int> b) {
return a.F * 1ll * b.S > a.S * 1ll * b.F;
}
int main(){
#ifdef home
freopen(TASK".in","r",stdin);
freopen(TASK".out","w",stdout);
#endif
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) cin >> q[i].F;
for (int i = 0; i < n; i++) cin >> q[i].S;
long long T = 0;
for (int i = 0; i < n; i++) T += q[i].S;
sort(q, q + n, &my);
double l = 0;
double r = 1;
vector<pair<int, pair<double, double> > > e;
for (int it = 0; it < 50; it++) {
double mid = (l + r) / 2;
long long alt = 0;
e.clear();
for (int i = 0; i < n; ) {
int j = i;
while (j < n && q[i].F * 1ll * q[j].S == q[i].S * 1ll * q[j].F) j++;
long long tt = 0;
for (int k = i; k < j; k++) tt += q[k].S;
for (int k = i; k < j; k++) {
double t1 = q[k].F * (1 - mid * (alt + q[k].S) / T);
double t2 = q[k].F * (1 - mid * (alt + tt) / T);
e.pb(mp(q[k].F, mp(t2, t1)));
}
alt += tt;
i = j;
}
sort(e.begin(), e.end());
/* cout << mid << endl;
for (int i = 0; i < e.size(); i++) cout << e[i].F << " " << e[i].S.F << " " << e[i].S.S << endl;
cout << endl;*/
// return 0;
int bad = 0;
double ma = -1;
for (int i = 0; i < n; i) {
int j = i;
while (j < n && e[i].F == e[j].F) j++;
for (int k = i; k < j; k++) if (e[k].S.F < ma) bad = 1;
for (int k = i; k < j; k++) ma = max(ma, e[k].S.S);
i = j;
}
if (bad) r = mid; else l = mid;
}
l = (l + r) / 2;
printf("%.10lf\n", l);
return 0;
}
