#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200005,INF=1e9;
int n,q,a[N],cnt;
struct node{
	int ls,rs,num;
	ll sum;
}tr[N*50];
void upd(int i,int l,int r,int x,int w){
	if(l==r){
		tr[i].num+=w;
		tr[i].sum+=1ll*w*x;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid){
		if(!tr[i].ls)tr[i].ls=++cnt;
		upd(tr[i].ls,l,mid,x,w);
	}
	else{
		if(!tr[i].rs)tr[i].rs=++cnt;
		upd(tr[i].rs,mid+1,r,x,w);
	}
	tr[i].sum=tr[tr[i].ls].sum+tr[tr[i].rs].sum;
	tr[i].num=tr[tr[i].ls].num+tr[tr[i].rs].num;
}
int qry(int i,int l,int r,ll sum){
	if(l==r){
		if(tr[i].sum<=sum)return tr[i].num;
		return sum/l;
	}
	int mid=l+r>>1;
	if(!tr[i].ls)return qry(tr[i].rs,mid+1,r,sum);
	if(!tr[i].rs)return qry(tr[i].ls,l,mid,sum);
	if(tr[tr[i].ls].sum<=sum)return tr[tr[i].ls].num+qry(tr[i].rs,mid+1,r,sum-tr[tr[i].ls].sum);
	return qry(tr[i].ls,l,mid,sum);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>q;
	ll neg=0;
	int sn=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]<=0){
			sn++;
			neg-=a[i];
		}
		else upd(0,1,INF,a[i],1);
	}
	while(q--){
		int x,v;
		cin>>x>>v;
		if(a[x]>0)upd(0,1,INF,a[x],-1);
		else{
			sn--;
			neg+=a[x];
		}
		a[x]=v;
		if(a[x]>0)upd(0,1,INF,a[x],1);
		else{
			sn++;
			neg-=a[x];
		}
		int mx=n-sn;
		int mn=max(0,mx-qry(0,1,INF,neg));
		cout<<mx-mn+1<<"\n";
	}
	return 0;
}