#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
pii A[200'002];
int B[200'002];
int ans[200'002];
int suf_ans[200'003];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
rep2(i,1,n+1) A[i].ss = i;
rep2(i,1,n+1) cin >> A[i].ff;
rep2(i,1,n) cin >> B[i];
sort(A+1,A+2+n);
sort(B+1,B+n+1);
for(int i = n+1; i >= 2; i--)
{
// cout << A[i].ff << " " << A[i].ss << " A\n";
suf_ans[i] = max(suf_ans[i+1],max(0,A[i].ff-B[i-1]));
// cout << suf_ans[i] << " suf\n";
}
int cur_ans = 0;
rep2(i,1,n+1)
{
ans[A[i].ss] = max(cur_ans,suf_ans[i+1]);
cur_ans = max(A[i].ff-B[i],cur_ans);
}
rep2(i,1,n+1) cout << ans[i] << " ";
}
