#include <bits/stdc++.h>
#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maxi(U &a, V b) {
if (a < b or a==-1) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)4e5 + 9;
const int mod = (int)1e9 + 7;
void prepare(); void main_code();
int main() {
ios::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);
}
const bool MULTITEST = 0; prepare();
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); }
}
void prepare() {};
int n, m, a[N], c[N];
namespace SUB4 {
const int N=2007;
long long dp[N][N];
void sol(vector<int> val) {
memset(dp, -1, sizeof dp);
dp[0][0]=0;
vector<int> ax(n + 1, 0);
FOR(i, 1, n) ax[i] = max(ax[i-1], a[i]);
// FOR(j,1,m) cout << val[j] << ' '; cout << nl;
// cerr << sz(val) << ' ' << m << nl;
int cnt=0;
FOR(i, 0, n - 1) {
cnt+=(a[i]==-1);
// cerr << i << nl;
FOR(j, 0, m) if (dp[i][j] != -1) {
// cerr << i << ' ' << j << nl;
maxi(dp[i][j+1], dp[i][j]);
int CUR_MAX=max(ax[i], val[j]);
if (a[i+1]==-1){
if (j != m)
maxi(dp[i+1][j+1], dp[i][j] + (val[j+1]>CUR_MAX)*c[val[j+1]]);
if(j>cnt)
maxi(dp[i+1][j], dp[i][j]);
} else {
maxi(dp[i+1][j], dp[i][j] + (a[i+1]>CUR_MAX)*c[a[i+1]]);
}
}
}
// n, m
FOR(k, 1, n) {
long long ans=0;
FOR(j,0,m)
ans=max(ans,dp[k][j]);
cout << ans << ' ';
}
}
};
void main_code() {
cin >> n;
for(int i = 1; i <= n; ++i) cin >> a[i];
for(int i = 1; i <= n; ++i) cin >> c[i];
vector<int> val(n + 1, 0);
vector<bool> ex(n + 1, 0);
for(int i = 1; i <= n; ++i) if (a[i] != -1) {
ex[a[i]] = 1;
}
FOR(i, 1, n) if (ex[i] == 0) val[++m] = i;
if (m == 0) {
// case
long long sum = 0;
int mx = 0;
FOR(i, 1, n) {
if (a[i]>mx)sum+=c[a[i]];
mx=max(mx,a[i]);
cout << sum << ' ';
}
return ;
}
if (m == n) {
// case
vector<long long> pref(n+2,0);
pref[n]=c[n];
FOD(i,n-1,1)pref[i]=pref[i+1]+c[i];
FOR(i, 1, n){
cout << pref[n-i+1] << ' ';
}
return ;
}
if (n <= 2000) {
return SUB4::sol(val), void();
}
}
/* Let the river flows naturally */
