// ~~ icebear love attttttt ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "gen"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int n, h[N], c[N];
vector<int> compress;

template<class T>
    struct FenwickTree {
        T ft[N];
        void reset() {
            FOR(i, 1, N - 5) ft[i] = 0;
        }

        void update(int x, T val) {
            for(; x < N; x += x & -x) ft[x] += val;
        }

        T get(int x) {
            T ans = 0;
            for(; x; x -= x & -x) ans += ft[x];
            return ans;
        }

        int search(int v) {
            int sum = 0, pos = 0;
            RED(i, 18)
                if (pos + MASK(i) < N && sum + ft[pos + MASK(i)] < v) {
                    pos += MASK(i);
                    sum += ft[pos];
                }
            return pos + 1;
        }
    };

FenwickTree<int> ftPos;
FenwickTree<__int128> ftC, ftCH;
__int128 sumC, sumCH;

void print(__int128 x) {
    vector<int> digit;
    if (x == 0) digit.pb(0);
    while(x) {
        digit.pb(x % 10);
        x /= 10;
    }
    while(!digit.empty()) cout << digit.back(), digit.pop_back();
}

__int128 f(int p) {
    int pos = ftPos.search(p);
    int height = compress[pos - 1];
    // cout << p << ' ' << height << endl;
    // print(ftC.get(pos)); cout << endl;
    // print(ftCH.get(pos)); cout << endl;
    __int128 res = ftC.get(pos) * height * 2 - sumC * height - ftCH.get(pos) * 2 + sumCH;
    return res;
}

void init(void) {
    cin >> n;
    FOR(i, 1, n) cin >> h[i], compress.pb(h[i]);
    FOR(i, 1, n) cin >> c[i];
    sort(all(compress));
    compress.resize(unique(all(compress)) - compress.begin());
    FOR(i, 1, n) h[i] = lower_bound(all(compress), h[i]) - compress.begin() + 1;
}

void process(void) {
    __int128 MAX = 1;
    FOR(i, 1, 100) MAX *= 2;
    ll tmp;
    FOR(i, 1, n) {
        tmp = 1LL * c[i] * compress[h[i] - 1];
        sumC += c[i];
        sumCH += tmp;
        ftC.update(h[i], c[i]);
        ftCH.update(h[i], tmp);
        ftPos.update(h[i], +1);
        int l = 1, r = i;
        while(r - l > 2) {
            int m1 = l + (r - l) / 3;
            int m2 = r - (r - l) / 3;
            if (f(m1) < f(m2)) r = m2;
            else l = m1;
        }
        __int128 res = MAX;
        FOR(j, l, r) minimize(res, f(j));
        print(res); cout << ' ';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}