THUPC2024 初赛

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) begin(a),end(a)
#define fi first
#define se second
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int N = 351495;
int n;
LL a[N],b[N],c[N];

void sub1() {
    LL sum = 0;
    vector<pair<LL,LL>> d;
    For(i,1,n)
        if( a[i] ) sum += min(a[i],b[i]);
        else if( b[i] ) d.pb(b[i],c[i]);
    sort(all(d),greater<pair<LL,LL>>());
    for(auto [b,c] : d) {
        if( !sum ) break; --sum;
        sum += min(1+c,b);
    }
    For(i,1,n)
        if( a[i] ) cout<<a[i]+sum-min(a[i],b[i])<<' ';
        else {
            if( sum ) {
                if( b[i] ) cout<<sum+1+c[i]-min(1+c[i],b[i])<<' ';
                else cout<<sum+c[i]<<' ';
            } else cout<<"0 ";
        }
    cout<<'\n';
}

void sub2() {
    LL sum = 0, ans = accumulate(a+1,a+n+1,0ll);
    vector<pair<LL,LL>> d;
    For(i,1,n)
        if( a[i] ) sum += min(a[i],b[i]);
        else d.pb(b[i],c[i]);
    sort(all(d),greater<pair<LL,LL>>());
    for(auto [b,c] : d) {
        if( !sum ) break; --sum;
        ans += c, sum += min(1+c,b);
    }
    cout<<ans<<'\n';
}

signed main() {
#ifdef FT
    freopen("in","r",stdin); freopen("out","w",stdout);
#endif
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>n; For(i,1,n) cin>>a[i]; For(i,1,n) cin>>b[i];
    For(i,1,n)
        if( a[i] ) a[i] += read();
        else cin>>c[i];
    sub1(), sub2();
    return 0;
}