#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
struct bla
{
    int pi_lao_zhi;
    int ju_li;
}c[100010];
short cmp(bla a,bla b)
{
    return a.pi_lao_zhi>b.pi_lao_zhi;
}
int main()
{
    int i,a[100010],b[100010],n,maxi=0;
    long long all=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=1;i<=n;i++)
    {
        scanf("%d",&b[i]);
        c[i].pi_lao_zhi=a[i]*2+b[i];
        c[i].ju_li=a[i];
    }
    sort(c+1,c+1+n,cmp);
    c[0].ju_li=0;
    for(i=1;i<=n;i++)
    {
        all=all+c[i].pi_lao_zhi;
        if(c[maxi].ju_li>c[i].ju_li)
        {
            all=all-c[i].ju_li*2;
        }
        else
        {
            all=all-c[maxi].ju_li*2;
            maxi=i;
            all=all+c[maxi].ju_li*2;
        }
        printf("%lld\n",all);
    }
    return 0;
}