我的代码：

#include <bits/stdc++.h>
using namespace std;
int n, s[1000086];
struct node {
    int a, b;
} c[1000086];
bool cmp (node x, node y) {
    return x.a * 2 + x.b > y.a * 2 + y.b;
}
int main () {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> c[i].a;
    for (int i = 1; i <= n; i++) cin >> c[i].b;
    sort (c + 1, c + n + 1, cmp);
    for (int i = 1; i <= n; i++) s[i] = s[i - 1] + c[i].b;
    for (int i = 1; i <= n; i++) {
        long long sum = c[1].a * 2ll + s[i];
        cout << sum << endl;
    }
    return 0;
}