#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int MAXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
int n;
long long v[MAXN], t[MAXN];
long long qz[MAXN];
long long ew[MAXN];
long long bit[MAXN];
int lowbit(int x) { return x & (-x); }
void add(int x, long long y) {
  while (x <= n) {
    bit[x] += y;
    x += lowbit(x);
  }
}
long long sum(int x) {
  long long res = 0;
  while (x) {
    res += bit[x];
    x -= lowbit(x);
  }
  return res;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%lld", &v[i]);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &t[i]);
    qz[i] = qz[i - 1] + t[i];
  }
  for (int i = 1; i <= n; i++) {
    int l = i;
    int r = n;
    int ind = n + 1;
    while (l <= r) {
      int mid = (r + l) / 2;
      if (qz[mid] - qz[i - 1] >= v[i]) {
        r = mid - 1;
        ind = mid;
      } else
        l = mid + 1;
    }
    if (ind == n + 1) {
      add(i, 1);
      add(n + 1, -1);
    } else {
      add(i, 1);
      add(ind, -1);
      ew[ind] += v[i] - (qz[ind - 1] - qz[i - 1]);
    }
  }
  for (int i = 1; i <= n; i++)
    printf("%lld%c", sum(i) * t[i] + ew[i], i == n ? '\n' : ' ');
  return 0;
}
