#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#include <string>

#include <vector>

#include <map>

#include <set>

#include <queue>

#include <list>

#include <cstdlib>

#include <iterator>

#include <cmath>

#include <iomanip>

#include <bitset>

#include <cctype>

using namespace std;

//#pragma GCC optimize(3)

//#pragma comment(linker, "/STACK:102400000,102400000")  //c++

#define lson (l , mid , rt << 1)

#define rson (mid + 1 , r , rt << 1 | 1)

#define debug(x) cerr << #x << " = " << x << "\n";

#define pb push_back

#define pq priority_queue

typedef long long ll;

typedef unsigned long long ull;

typedef pair<ll ,ll > pll;

typedef pair<int ,int > pii;

typedef pair<int ,pii> p3;

//priority_queue<int> q;//这是一个大根堆q

//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q

#define fi first

#define se second

//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)

#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行

#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)

//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFFLL;  //

const ll nmos = 0x80000000LL;  //-2147483648

const int inf = 0x3f3f3f3f;

const ll inff = 0x3f3f3f3f3f3f3f3fLL; //

const double PI=acos(-1.0);

template<typename T>

inline T read(T&x){

    x=;int f=;char ch=getchar();

    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    return x=f?-x:x;

}

// #define _DEBUG;         //*//

#ifdef _DEBUG

freopen("input", "r", stdin);

// freopen("output.txt", "w", stdout);

#endif

/*-----------------------show time----------------------*/

            const int maxn = 1e5+;

            struct node

            {

                int s,p;

            }a[maxn];

            bool cmp(const node &a,const node &b){

                return a.p > b.p;

            };

            int sum[maxn],mx,h[maxn];

int main(){

            int n;

            scanf("%d", &n);

            for(int i=; i<=n; i++)scanf("%d", &a[i].s);

            for(int i=; i<=n; i++)scanf("%d", &a[i].p);

            sort(a+,a++n,cmp);

            for(int i=; i<=n; i++){

                sum[i] = sum[i-] + a[i].p;

            }

            for(int i=n; i>=; i--){

                h[i] = max(h[i+],a[i].s *  + a[i].p);

            }

            for(int i=; i<=n; i++){

                if(mx < a[i].s) mx = a[i].s;

                int tmp = sum[i] +  * mx;

                tmp = max(tmp , sum[i-] + h[i]);

                printf("%d\n", tmp);

            }

            return ;

}