#include <bits/stdc++.h>
bool debug = 1;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
const double eps = 1e-9;
using namespace std;
int n;
long long v[100100];
long long t[100100];
long long acumt[100100];
long long modif[100100];
long long qtd[100100];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &v[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &t[i]);
    acumt[i] = acumt[i - 1] + t[i];
  }
  for (int i = 1; i <= n; i++) {
    qtd[i]++;
    int pos =
        lower_bound(acumt + i, acumt + n + 1, v[i] + acumt[i - 1]) - acumt;
    qtd[pos]--;
    modif[pos] += v[i] - (acumt[pos - 1] - acumt[i - 1]);
  }
  long long x = 0;
  for (int i = 1; i <= n; i++) {
    x += qtd[i];
    printf("%lld ", modif[i] + x * t[i]);
  }
  cout << endl;
  return 0;
}
