破译密码 参考代码

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
const int maxn = 1000 + 100;
struct Node {
    int a, b;
};

bool operator<(const Node &a, const Node &b) {
    return max(a.a + a.b, a.a + b.a) + b.b < max(b.a + b.b, b.a + a.a) + a.b;
}

int n, ta, ans;
Node node[maxn];

int main() {
#ifdef ExRoc
    freopen("test.txt", "r", stdin);
#endif // ExRoc
    ios::sync_with_stdio(false);

    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> node[i].a;
    }
    for (int i = 0; i < n; ++i) {
        cin >> node[i].b;
    }
    sort(node, node + n);
    for (int i = 0; i < n; ++i) {
        ta += node[i].a;
        ans = max(ans, ta) + node[i].b;
    }
    cout << ans << endl;

    return 0;
}