#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define int long long
const int N=1002021,eps=1e-17;
int n,sz,a[N],b[N],id[N<<3]; double stk[N*3],loc[N];
struct Tr{int w,f,_f,mi;}tr[N<<3];
void pushr(int x,int w,int _w){
	tr[x].w+=_w; tr[x].f+=w; tr[x]._f+=_w; tr[x].mi+=w;
}
void down(int k){
	if(tr[k].f || tr[k]._f){pushr(k<<1,tr[k].f,tr[k]._f); pushr(k<<1|1,tr[k].f,tr[k]._f); tr[k].f=tr[k]._f=0;}
}
double F(int k){
	if(k<1 || k>sz)return 4e18;
//	cerr<<"F "<<k<<" : "<<stk[k]<<" "<<tr[id[k]].w<<endl;
	return stk[k]*1.0*tr[id[k]].mi+1.0*tr[id[k]].w;
}
int query(int k,int l,int r){
//	cout<<"query "<<k<<" "<<l<<" "<<r<<" "<<tr[k].w<<endl;
	if(l==r)return l;
//	{
//		cerr<<stk[l]<<" "<<tr[k].w<<endl;
//		return stk[l]*1.0*tr[k].w;
//	}
	down(k);
	int mid=(l+r)>>1;
	if(tr[k<<1|1].mi>0)
		return query(k<<1,l,mid);
	else return query(k<<1|1,mid+1,r);
}
void change(int k,int l,int r,int ql,int qr,int ad,int ab){
	if(ql<=l && qr>=r)return pushr(k,ad,ab);
	down(k); int mid=(l+r)>>1;
	if(ql<=mid)change(k<<1,l,mid,ql,qr,ad,ab);
	if(qr>mid)change(k<<1|1,mid+1,r,ql,qr,ad,ab);
//	tr[k].w=tr[k<<1].w+tr[k<<1|1].w;
	tr[k].mi=min(tr[k<<1].mi,tr[k<<1|1].mi);
}
void build(int k,int l,int r){
	if(l==r)return id[l]=k,void();
	int mid=(l+r)>>1; build(k<<1,l,mid); build(k<<1|1,mid+1,r);
}
void pushdown(int k,int l,int r,int x){
	if(x<1 || x>sz)return;
	if(l==r)return;
	down(k); int mid=(l+r)>>1;
	(x<=mid)?pushdown(k<<1,l,mid,x):pushdown(k<<1|1,mid+1,r,x);
	tr[k].mi=min(tr[k<<1].mi,tr[k<<1|1].mi);
}
int read(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
#undef int
int main()
{
//	freopen("I.in","r",stdin);
//	freopen("I.out","w",stdout);
	#define int long long
	n=read(); int sumb=0,top=0;
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)b[i]=read();
	for(int i=1;i<=n;i++)
		if(a[i]<0)a[i]=-a[i],b[i]=-b[i];
	for(int i=1;i<=n;i++){
		loc[i]=1.0*(-b[i])/(1.0*a[i]);
		stk[++top]=loc[i]-(1e-14),stk[++top]=loc[i],stk[++top]=loc[i]+(1e-14);
	}
	sort(stk+1,stk+top+1);
	sz=unique(stk+1,stk+top+1)-(stk+1);
//	cerr<<"sz="<<sz<<endl;
//	for(int i=1;i<=sz;i++)
//		printf("%0.10lf\n",stk[i]);
	build(1,1,sz);
	for(int i=1;i<=n;i++){
		sumb+=b[i];
		loc[i]=lower_bound(stk+1,stk+sz+1,loc[i])-stk;
		change(1,1,sz,1,loc[i],-a[i],-b[i]);
		change(1,1,sz,loc[i]+1,sz,a[i],b[i]);
//		cerr<<"change "<<loc[i]<<endl;
		int res=query(1,1,sz);
//		printf("%0.20lf %0.20lf\n",F(res),F(res+1));
		pushdown(1,1,sz,res+1); pushdown(1,1,sz,res-1);
//		cerr<<res<<" "<<stk[res]<<" "<<stk[res+1]<<endl;
		printf("%0.8lf\n",min(F(res-1),min(F(res),F(res+1))));
	}
	return 0;
}
/*
10
3 5 1 1 2 3 1 4 3 4
1 3 1 1 1 2 2 1 1 4

5
3 5 1 1 2
1 3 1 1 1

*/