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

int n,q,c2[1110000],tot,sz;
LL c1[1110000],a[1110000];
pair<int,int> rea[210000];
map<int,int> mp;

inline int lowbit(int x) {
    return x&(-x);
}

void change1(int x,LL k)
{
    while(x<=tot) {
        c1[x]+=k;
        x+=lowbit(x);
    }
}

LL query1(int x)
{
    LL sum=0;
    while(x>0) {
        sum+=c1[x];
        x-=lowbit(x);
    }
    return sum;
}

void change2(int x,int k)
{
    while(x<=tot) {
        c2[x]+=k;
        x+=lowbit(x);
    }
}

int query2(int x)
{
    int sum=0;
    while(x>0) {
        sum+=c2[x];
        x-=lowbit(x);
    }
    return sum;
}

inline bool check(int x)
{
    LL sum=query1(x);
    return sum<=0;
}

void solve()
{
    cin>>n>>q; tot=0;
    for(int i=1;i<=n;i++) {
        cin>>a[i];
        mp[a[i]]=1;
    }
    for(int i=1;i<=q;i++) {
        cin>>rea[i].first>>rea[i].second;
        mp[rea[i].second]=1;
    }
    for(auto it=mp.begin();it!=mp.end();it++) {
        it->second=++tot;
    }
    for(int i=1;i<=n;i++) {
        change1(mp[a[i]],a[i]);
        change2(mp[a[i]],1);
        if(a[i]>0) ++sz;
    }
    for(int i=1;i<=q;i++) {
        change1(mp[rea[i].second],rea[i].second),change2(mp[rea[i].second],1);
        change1(mp[a[rea[i].first]],-a[rea[i].first]),change2(mp[a[rea[i].first]],-1);
        if(a[rea[i].first]>0) --sz;
        if(rea[i].second>0) ++sz;
        a[rea[i].first]=rea[i].second;
        int l=0,r=tot,pos;
        while(l<=r) {
            int mid=l+r>>1;
            if(check(mid)) l=mid+1,pos=mid;
            else r=mid-1;
        }
        int sum=query2(pos);
//cout << sum << endl;
        cout<<sz-n+sum+1<<endl;
    }
}

signed main()
{
    cin.tie(0) -> sync_with_stdio(false);
    solve();
    //return 0;
}