#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#define endl '\n'
#define int long long
#define mod 1000000007
using namespace std;
int a[400001],c[400001],b[40001];
int ans[400001];
int dp[3][400001];
int boo[400001];
int m,sz;
vector<int>x;
signed main(){
int n; cin >> n;
b[0] = -1;
for(int i = 1; i <= n; i++) {
cin >> a[i];
b[i] = max(a[i], b[i - 1]);
if(a[i] > -1) boo[a[i]] = 1;
}
for(int i = 1; i <= n; i++) cin >> c[i];
vector<int>x;
for(int j = 1; j <= n; j++){
if(!boo[j]) {
x.push_back(j);
}
}
int k = 0;
for(int i = 1; i <= n; i++){
if(a[i] == -1) b[i] = max(b[i], x[k++]);
b[i] = max(b[i - 1], b[i]);
}
for(int i = 1; i <= n; i++){
for(int j = 0; j <= n; j++) dp[i][j] = -1e9;
}
for(int i = 1; i <= n; i++){
int xx = b[i];
for(int j = xx; j <= n; j++){
if(a[i] == -1){
if(!boo[j]) dp[1][j] = max(dp[0][j - 1] + c[j],dp[1][j]);
}else{
if(j == a[i]) dp[1][j] = max(dp[0][j - 1] + c[j],dp[1][j]);
}
dp[1][j] = max(dp[0][j], dp[1][j]);
dp[1][j] = max(dp[1][j - 1], dp[1][j]);
}
ans[i] = dp[1][n];
for(int j = xx; j <= n; j++){
dp[0][j] = dp[1][j];
dp[1][j] = -1e18;
}
}
int mx = 0;
for(int i = 1; i <= n; i++){
mx = max(mx,ans[i]);
cout << mx << ' ';
}
}
