# 大型运算符3## 题目描述按顺序输入正整数 $n$$nle1000$、$n$ 个正整数 $a_i$$1le ile n~a_ile1000$、$n$ 个正整数 $b_i$$1le ile n~b_ile1000$输出$$max_i=1^nleftleftsum_j=1^i-1a_jright-b_iright$$## 输入格式第一行一个正整数 $n$$nle1000$。第二行 $n$ 个正整数

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    int a[n], b[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    int max_sum = -1000000, sum = 0;
    for (int i = 0; i < n; i++) {
        sum += a[i];
        max_sum = max(max_sum, sum - b[i]);
    }
    cout << max_sum << endl;
    return 0;
}