#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1, 0);
    vector<int> b(n + 1, 0);
    ll sum_fu = 0;
    ll sum_zh = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] > 0)
            sum_zh += a[i];
        else if (a[i] < 0)
            sum_fu += -a[i];
    }
    set<pair<int, int>> sepre;
    set<pair<int, int>> sesuf;
    ll sum_pre = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] > 0)
            sesuf.insert({a[i], i});
    }
    while (sum_pre <= sum_fu && sesuf.size())
    {
        sepre.insert(*sesuf.begin());
        b[(*sesuf.begin()).second] = 1;
        sum_pre += (*sesuf.begin()).first;
        sesuf.erase(*sesuf.begin());
    }
    // cout << sesuf.size() << '\n';
    // for (auto v : sesuf)
    // {
    //     cout << v.first << ' ' << v.second << '\n';
    // }
    while (m--)
    {
        int p, v;
        cin >> p >> v;
        // cout << "a[p]" << a[p] << ' ' << b[p] << '\n';
        if (b[p] == 1)
        {
            // if (sepre.size())
            // for (auto v : sepre)
            // {
            //     cout << v.first << ' ' << v.second << '\n';
            // }

            sepre.erase(sepre.find({a[p], p}));
            b[p] = 0;
            sum_pre -= a[p];
            // cout << "siz" << ' ' << sepre.size() << '\n';
        }
        else
        {
            if (a[p] > 0)
            {
                // cout << a[p] << ' ' << p << '\n';
                sesuf.erase(sesuf.find({a[p], p}));
                sum_zh -= a[p];
            }
            else
            {
                sum_fu -= -a[p];
            }
        }
        if (v > 0)
        {
            sum_zh += v;
            sesuf.insert({v, p});
        }
        else
        {
            sum_fu += -v;
        }
        while (sum_pre <= sum_fu && sesuf.size())
        {
            sepre.insert(*sesuf.begin());
            b[(*sesuf.begin()).second] = 1;
            sum_pre += (*sesuf.begin()).first;
            sesuf.erase(*sesuf.begin());
        }
        a[p] = v;
        // cout << m << " ";
        // for (auto v : sepre)
        // {
        //     cout << v.first << ' ' << v.second << '\n';
        // }
        // cout << sum_pre << ' ' << ' ' << sum_fu << '\n';
        // cout << sepre.size() << " " << sesuf.size() << '\n';
        cout << sepre.size() + sesuf.size() - (sum_pre <= sum_fu ? 0 : sesuf.size() + 1) + 1 << '\n';
    }
}
int main()
{
    // IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}