//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
using std::bitset;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	template<class T,class... Args>
	inline void read(T& t,Args&... args) {
		read(t);
		read(args...);
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x) {
		if(x==0){
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		register int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
#define mid ((l+r)>>1)
int n,q,c[200002];
ll mmax[800002],tag[800002],sum;
inline void pushdown(int pos){
	if(tag[pos]){
		tag[pos<<1]+=tag[pos],tag[pos<<1|1]+=tag[pos];
		mmax[pos<<1]+=tag[pos],mmax[pos<<1|1]+=tag[pos];
		tag[pos]=0;
	}
}
inline void add(int pos,int l,int r,int ql,int qr,int v){
	if(ql<=l&&qr>=r){
		tag[pos]+=v,mmax[pos]+=v;
		return;
	}
	pushdown(pos);
	if(ql<=mid)add(pos<<1,l,mid,ql,qr,v);
	if(qr>mid)add(pos<<1|1,mid+1,r,ql,qr,v);
	mmax[pos]=max(mmax[pos<<1],mmax[pos<<1|1]);
}
inline void add(int pos,int v){
	if(v&1)add(1,1,n,(pos+2)>>1,n,-1);
	add(1,1,n,pos,n,v>>1),sum+=(v>>1);
	c[pos]=v;
}
inline void mns(int pos,int v){
	if(v&1)add(1,1,n,(pos+2)>>1,n,1);
	add(1,1,n,pos,n,-(v>>1)),sum-=(v>>1);
	c[pos]=v;
}
int main() {
	cin>>n>>q;
	F(i,1,n){
		add(i,read());
	}
	F(asdf,1,q){
		int pos=read(),d=read();
		mns(pos,c[pos]);
		add(pos,c[pos]+d);
		int ans=max(mmax[1],0ll);
		write(sum-(ans+2)/3,'\n');
	}
	return 0;
}