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

#define int long long
const int SIZE = 2e5+10;
int a[SIZE];
multiset<int> pos1, pos2;

signed main(){
    //freopen("out.txt", "w", stdout);
    ios :: sync_with_stdio(false);
    int n, q, cnt_neg = 0, s_neg = 0, s_pos = 0;
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i] <= 0) cnt_neg++, s_neg += a[i];
        else pos1.insert(a[i]), s_pos += a[i];
    }
    while(pos1.size() && s_neg+s_pos > 0){
        int x = *(--pos1.end());
        pos2.insert(x);
        s_pos -= x;
        pos1.erase(--pos1.end());
    }
    for(int i = 1; i <= q; i++){
        int x, y;
        cin >> x >> y;
        if(a[x] <= 0) s_neg -= a[x];
        else{
            if(pos1.count(a[x])) s_pos -= a[x], pos1.erase(pos1.find(a[x]));
            else pos2.erase(pos2.find(a[x]));
        }
        if(y <= 0) s_neg += y;
        else{
            if(pos1.size() && y <= *(--pos1.end())) pos1.insert(y), s_pos += y;
            else pos2.insert(y);
        }
        while(pos2.size() && s_neg+s_pos+*pos2.begin() <= 0){
            int x = *pos2.begin();
            pos1.insert(x);
            s_pos += x;
            pos2.erase(pos2.begin());
        }
        while(pos1.size() && s_neg+s_pos > 0){
            int x = *(--pos1.end());
            pos2.insert(x);
            s_pos -= x;
            pos1.erase(--pos1.end());
        }
        a[x] = y;
        cout << pos1.size()+1 << endl;
    }
    return 0;
}