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

int n, q;
int64_t qt;
const int N = 2e5+5;
int a[N];

map<int, long> sum, cnt;
map<int, int> c2;
int cntp;
const int LIM = 1e9+7;

void fwmod(map<int, long> &c, int x, long v) {
  for (; x < LIM; x += x & -x) c[x] += v;
}

long fwget(map<int, long> &c, int x) {
  long ret = 0;
  for (; x; x -= x & -x) ret += c[x];
  return ret;
}

void rem(int x) {
  --cntp;
  ++c2[x];
  fwmod(cnt, x, -1);
  fwmod(sum, x, -x);
}

void ins(int x) {
  ++cntp;
  --c2[x];
  fwmod(cnt, x, 1);
  fwmod(sum, x, x);
}

int qry() {
  int x = 0;
  long xs = 0;
  for (int i = 29; i >= 0; --i) if ((x+(1<<i)<LIM) && xs+sum[x+(1<<i)] < qt) {
    x += 1<<i;
  }
  // cout << "dbg" << x << '\n';
  if (x > LIM) {
    return cntp+1;
  }
  int res = fwget(cnt, x);
  int nn = cnt[x+1];
  res += (qt-xs) / (x+1);
  return res+1;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    if (a[i] <= 0) qt -= a[i];
    else ins(a[i]);
  }
  while (q--) {
    int x, v;
    cin >> x >> v;
    if (a[x] <= 0) qt += a[x];
    else rem(a[x]);
    a[x] = v;
    if (v <= 0) qt -= v;
    else ins(v);
    cout << qry() << '\n';
  }
  return 0;
}