#include<bits/stdc++.h>
using namespace std;
#define rg register
#define ll long long
#define ull unsigned ll
#define lowbit(x) (x&(-x))
#define djq 59393
const double eps=1e-10;
const short sint=0x3f3f;
const int inf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;
const double alpha=0.73;
const double PI=acos(-1);
inline void file(){
	freopen("entrench.in","r",stdin);
	freopen("entrench.out","w",stdout);
}
inline ll read(){
	rg ll ret=0,f=0;char ch=getchar();
    while(!isdigit(ch)){if(ch==EOF)exit(0);if(ch=='-')f=1;ch=getchar();}
    while(isdigit(ch)){ret=ret*10+ch-48;ch=getchar();}
    return f?-ret:ret;
}

#define ep emplace
#define epb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define it iterator
#define mkp make_pair
#define naive return 0*puts("Yes")
#define angry return 0*puts("No")
#define fls fflush(stdout)
#define rep(i,x,y) for(rg int i=(x);i<=(y);++i)
#define per(i,x,y) for(rg int i=(x);i>=(y);--i)
#define rep0(i,a) for(rg int i=0;i<=a;++i)
#define per0(i,a) for(rg int i=a;~i;--i)
#define szf sizeof
typedef vector<int> vec;
typedef pair<int,int> pii;
struct point{ int x,y; point(int x=0,int y=0):x(x),y(y) {} inline bool operator<(const point& T)const{ return x^T.x?x<T.x:y<T.y; }; };
inline int ksm(int base,int p){int ret=1;while(p){if(p&1)ret=1ll*ret*base%djq;base=1ll*base*base%djq,p>>=1;}return ret;}
inline void pls(int& x,const int k){ x=(x+k>=djq?x+k-djq:x+k); }
inline int add(const int a,const int b){ return a+b>=djq?a+b-djq:a+b; }
inline void sub(int& x,const int k){ x=(x-k<0?x-k+djq:x-k); }
inline int inc(const int a,const int b){ return a<b?a-b+djq:a-b; }
inline void ckmn(int& x,const int k){ x=(k<x?k:x); }
inline void ckmx(int& x,const int k){ x=(k>x?k:x); }
inline void ckmn(ll& x,const ll k){ x=(k<x?k:x); }
inline void ckmx(ll& x,const ll k){ x=(k>x?k:x); }
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


struct func{
	ll x,y;
	func(ll x=0,ll y=0):x(x),y(y) {}
};
const func Z=func(0,0);
inline func operator+(func x,func y){ return func(x.x+y.x,x.y+y.y); }
inline func operator-(func x,func y){ return func(x.x-y.x,x.y-y.y); }
int n,m,a[500005],b[500005],pos[500005];
pair<pii,int> c[500005];
func v[500005][2],all;
ll ex;
	func bit[500005];
	inline void ad(int x,const func k){
		while(x<=m) bit[x]=bit[x]+k,x+=(x&(-x));
	}
	inline func qr(int x){
		func res=Z;
		while(x) res=res+bit[x],x-=(x&(-x));
		return res;
	}

inline double gv(int x){
	func f1=qr(x),f0=Z-(all-f1),res=f1+f0;
	double vx=(double)c[x].fi.fi/(double)c[x].fi.se;
	//printf("vx=%.6lf k=%lld b=%lld\n",vx,res.x,res.y);
	return vx*res.x+res.y;
}
signed main(){
//	file();
	n=read();
	rep(i,1,n) a[i]=read();
	rep(i,1,n) b[i]=read();
	rep(i,1,n){
		func nv=func(a[i],b[i]);
		pii nw;
		nw.fi=-b[i],nw.se=a[i];
		if(a[i]==0) continue;
		if(a[i]<0) nw.se=-nw.se,nw.fi=-nw.fi;
		c[++m]=mkp(nw,i);
		if(a[i]>0) v[i][1]=nv,v[i][0]=Z-nv;
		else v[i][0]=nv,v[i][1]=Z-nv;
	}
	sort(c+1,c+1+m,[&](const pair<pii,int>& x,const pair<pii,int>& y){
		return 1ll*x.fi.fi*y.fi.se<1ll*y.fi.fi*x.fi.se;	
	});
	rep(i,1,m) pos[c[i].se]=i;
	//rep(i,1,m) printf("(%d/%d) %d\n",c[i].fi.fi,c[i].fi.se,c[i].se);
	all=Z;
	rep(i,1,n){
		if(a[i]==0){
			ex+=abs(b[i]);
		}else{
			all=all+v[i][1];
			ad(pos[i],v[i][1]);
		}
		int l=1,r=m;
		double ans=gv(l);
		while(l<r){
			const int mid=(l+r+1)/2;
			double v1=gv(mid),v0=gv(mid-1);
			if(v1<=v0) l=mid,ans=min(ans,v1);
			else r=mid-1;
		}
		ans+=ex;
		printf("%.8lf\n",ans);
	}
	return 0; 
}
/*

*/