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

const LL N = 4e5 + 5;
map<LL, LL> mp;
// LL root[N];
// LL a[N];
// struct seg_tree{
//     LL val;
//     LL lson;
//     LL rson;
// }tree[n<<5];

// LL tot = 1;
// LL clone(LL node){
//     tot++;
//     tree[tot] =  tree[node];
//     return tot;
// };

// LL update(LL u, LL v, LL x, LL l, LL r){
//     u = ++tot;
//     tree[u] = tree[v];
//     tree[u].val++;
//     if(l == r){
//         return u;
//     }
//     LL mid = (l + r) / 2;
//     if(x <= mid){tree[u].lson = update(tree[u].lson, tree[v].lson, x, l, mid);}
//     else tree[u].rson = upodate(tree[u].rson, tree[v].rson, x, mid + 1, r);
//     return u;
// }

// LL query()

LL c[N], z[N];

LL lowbit(LL x){
    return x & -x;
}

LL zsum(LL x){
    LL ans = 0;
    while(x > 0){
        ans += z[x];
        x -= lowbit(x);
    }
    return ans;
}

LL qsum(LL x){
    LL ans = 0;
    while(x > 0){
        ans += c[x];
        x -= lowbit(x);
    }
    return ans;
}

void addz(LL k, LL x){
    while(x < N){
        z[x] += k;
        x += lowbit(x);
    }
}

void add(LL k, LL x){
    while(x < N){
        c[x] += k;
        x += lowbit(x);
    }
}



void solve(){
    LL n, q;
    cin >> n >> q;
    vector<LL> a(n + 1);
    vector<pair<LL,LL>> qq(q + 1);
    vector<LL> temp;
    // temp.push_back(0);
    LL sum = 0;
    // multiset<LL> s;
    LL num = 0;
    for(LL i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i] <= 0){sum -= a[i];}
        else{temp.push_back(a[i]);}
    }
    for(LL i = 1; i <= q; i++){
        LL x, v;
        cin >> qq[i].first >> qq[i].second;
        if(qq[i].second > 0){temp.push_back(qq[i].second);}
    }
    sort(temp.begin(), temp.end());
    temp.erase(unique(temp.begin(), temp.end()), temp.end());
    for(LL i = 0; i < temp.size(); i++){
        mp[temp[i]] = i + 1;
    }
    for(LL i = 1; i <= n; i++){
        if(a[i] > 0) {
            addz(1, mp[a[i]]);
            add(a[i], mp[a[i]]);
            num++;
        }
    }
    for(LL i= 1; i <= q; i++){
        auto [x, v] = qq[i];
        if(v > 0){
            if(a[x] > 0){
                addz(-1, mp[a[x]]);
                add(-1LL * a[x], mp[a[x]]);
                num--;
            }
            else{
                sum += a[x];//a[x] < 0
            }
            addz(1, mp[v]);
            a[x] = v;
            add(v, mp[v]);
            num++;
        }
        else{
            if(a[x] > 0) {
                num--;
                addz(-1LL, mp[a[x]]);
                add(-1LL * a[x], mp[a[x]]);
            }
            else{
                sum += a[x];
            }
            a[x] = v;
            sum -= v;
        }
      
        LL l = 1; 
        LL r = N - 3;
        LL ans = 0;
        while(l <= r) {
            LL mid = (l + r) / 2;
            if(qsum(mid) > sum) {r = mid - 1;}
            else {ans = mid; l = mid + 1;}
        }
        cout << zsum(r) + 1 << '\n'; 
        // cout << l << ' ' << r << ' ' << ans << endl;
    }
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    // LL t; cin >> t;
    // while (t--) 
            
    solve();
}