#include<bits/stdc++.h>
using namespace std;
struct apple{
	int a,b;
	bool operator<(const apple &other)const{
		return 1ll*a*other.b>1ll*b*other.a;
	}
}e[500005];
int ss[500005];
long long sm[2000005];
double s2[2000005];
int A[500005],B[500005];
void add(int l,int r,int o,int x,int v){
	if(v==0)return;
	if(l==r){
		sm[o]+=v,s2[o]+=1.0*v*e[x].b/e[x].a;
		return;
	}
	int mid=(l+r)>>1;
	if(x<=mid)add(l,mid,o<<1,x,v);
	else add(mid+1,r,o<<1|1,x,v);
	sm[o]=sm[o<<1]+sm[o<<1|1];
	s2[o]=s2[o<<1]+s2[o<<1|1];
}
int query(int l,int r,int o,long long pm){
	if(l==r)return l;
	int mid=(l+r)>>1;
	if(pm<=sm[o<<1])return query(l,mid,o<<1,pm);
	return query(mid+1,r,o<<1|1,pm-sm[o<<1]);
}
double query2(int l,int r,int o,int x,double zz){
	if(l==r){
		return 0;
	}
	int mid=(l+r)>>1;
	if(x<=mid){
		double ans=s2[o<<1|1]-sm[o<<1|1]*zz;
		return ans+query2(l,mid,o<<1,x,zz);
	}
	double ans=sm[o<<1]*zz-s2[o<<1];
	return ans+query2(mid+1,r,o<<1|1,x,zz);
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;++i)scanf("%d",&e[i].a);
	for(int i=1;i<=n;++i)scanf("%d",&e[i].b);
	for(int i=1;i<=n;++i){
		if(e[i].a==0){
			ss[i]=abs(e[i].b);
		}
		if(e[i].a<0)e[i].a=-e[i].a,e[i].b=-e[i].b;
		A[i]=e[i].a,B[i]=e[i].b;
	}
	sort(e+1,e+n+1);
	map<pair<int,int>,int>mp;
	for(int i=1;i<=n;++i)mp[make_pair(e[i].a,e[i].b)]=i;
	long long he=0;
	long long gs=0;
	for(int i=1;i<=n;++i){
		he+=ss[i];
		gs+=A[i];
		int wz=mp[make_pair(A[i],B[i])];
		add(1,n,1,wz,A[i]);
		int df=query(1,n,1,(gs+1)/2);
		printf("%.10f\n",he+query2(1,n,1,df,1.0*e[df].b/e[df].a));
	}
	return 0;
}