#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n,a[500001],b[500001],cnt,sum[500001<<2],qwq,qaq;
double node[500001],ans[500001<<2];
inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-')
            f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline int ls(int k)
{
    return k<<1;
}
inline int rs(int k)
{
    return k<<1|1;
}
inline void push_up(int k)
{
    sum[k]=sum[ls(k)]+sum[rs(k)];
    ans[k]=ans[ls(k)]+ans[rs(k)];
}
inline void update(int node,int l,int r,int k,int p1,double p2)
{
    if(l==r)
    {
        sum[k]+=p1;
        ans[k]+=p1*p2;
        return;
    }
    int mid=(l+r)>>1;
    if(node<=mid)
        update(node,l,mid,ls(k),p1,p2);
    else
        update(node,mid+1,r,rs(k),p1,p2);
    push_up(k);
}
inline int query1(int l,int r,int k,int p)
{
    if(l==r)
        return l;
    int mid=(l+r)>>1;
    if(p<=sum[ls(k)])
        return query1(l,mid,ls(k),p);
    return query1(mid+1,r,rs(k),p-sum[ls(k)]);
}
inline int query2(int nl,int nr,int l,int r,int k)
{
    if(nl>nr)
        return 0;
    if(l>=nl&&r<=nr)
        return sum[k];
    int mid=(l+r)>>1,res=0;
    if(nl<=mid)
        res+=query2(nl,nr,l,mid,ls(k));
    if(nr>mid)
        res+=query2(nl,nr,mid+1,r,rs(k));
    return res;
}
inline double query3(int nl,int nr,int l,int r,int k)
{
    if(nl>nr)
        return 0.0000;
    if(l>=nl&&r<=nr)
        return ans[k];
    int mid=(l+r)>>1;
    double res=0;
    if(nl<=mid)
        res+=query3(nl,nr,l,mid,ls(k));
    if(nr>mid)
        res+=query3(nl,nr,mid+1,r,rs(k));
    return res;
}
int main()
{
    n=read();
    for(int i=1;i<=n;++i)
        a[i]=read();
    for(int i=1;i<=n;++i)
    {
        b[i]=read();
        if(a[i])
            node[++cnt]=-1.0*b[i]/a[i];
    }
    sort(node+1,node+cnt+1);
    cnt=unique(node+1,node+n+1)-node-1;
    for(int i=1;i<=n;++i)
    {
        if(!a[i])
            qwq+=abs(b[i]);
        else
        {
            int pos=lower_bound(node+1,node+cnt+1,-1.0*b[i]/a[i])-node;
            update(pos,1,cnt,1,abs(a[i]),-1.0*b[i]/a[i]);
            qaq+=abs(a[i]);
        }
        int tmp=query1(1,cnt,1,(qaq+1)>>1);
        printf("%.10lf\n",qwq+node[tmp]*query2(1,tmp-1,1,cnt,1)-query3(1,tmp-1,1,cnt,1)-node[tmp]*query2(tmp+1,cnt,1,cnt,1)+query3(tmp+1,cnt,1,cnt,1));
    }
    return 0;
}