#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 2e5 + 100;
const int INF = 1e9;
int tot = 1;

struct node {
    int lson, rson, num;
    LL sum;
} seg[N * 120];

#define ls seg[id].lson
#define rs seg[id].rson

void pushdown(int id) {
    if (!ls) ls = ++tot;
    if (!rs) rs = ++tot;
}

void pushup(int id) {
    seg[id].sum = seg[ls].sum + seg[rs].sum;
    seg[id].num = seg[ls].num + seg[rs].num;
}

void modify(int id, int l, int r, int pos, int val) {
    if (l == r) {
        seg[id].num += val;
        seg[id].sum += pos * val;
        return;
    }

    pushdown(id);
    int mid = (l + r) / 2;
    if (pos <= mid) {
        modify(ls, l, mid, pos, val);
    } else {
        modify(rs, mid + 1, r, pos, val);
    }
    pushup(id);
}

int query(int id, int l, int r, LL sum) {
    if (l == r) {
        return (sum <= 0 ? 0 : seg[id].num);
    }

    int mid = (l + r) / 2;
    if (seg[rs].sum >= sum) {
        return query(rs, mid + 1, r, sum);
    } else {
        return query(ls, l, mid, sum - seg[rs].sum) + seg[rs].num;
    }
}

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n + 1);
    LL sum = 0;
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i];
        if (a[i] > 0) {
            modify(1, 1, INF, a[i], 1);
            cnt++;
        }
    }
    while (q--) {
        int idx, val;
        cin >> idx >> val;
        if (a[idx] > 0) {
            modify(1, 1, INF, a[idx], -1);
            cnt--;
        }
        if (val > 0) {
            modify(1, 1, INF, val, 1);
            cnt++;
        }
        sum = sum - a[idx] + val;
        a[idx] = val;
        cout << cnt - query(1, 1, INF, sum) + 1 << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}