Submission #68742419

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
#define endl '\n'
using db = double;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, Q;
    cin >> n >> Q;
    vector<LL> a(n + 1), b(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n; ++i)
        cin >> b[i];
    LL sum = 0;
    for (int i = 1; i <= n; ++i)
        sum += min(a[i], b[i]);
    while (Q--)
    {
        char p;
        LL i, x;
        cin >> p >> i >> x;
        sum -= min(a[i], b[i]);
        if (p == 'A')
            a[i] = x;
        else
            b[i] = x;
        sum += min(a[i], b[i]);
        cout << sum << endl;
    }
    return 0;
}

Submission Info

Judge Result