#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000
#define MAX 1048576

typedef long long ll;

int bit[MAX+1];
int item[1000001];

int main() {
    int i, n, k;
    cin >> n >> k;
    rep (i,n) {
        int w;
        cin >> w;
        if (w > 0) {
            int x = w-1;
            int sum = bit[MAX];
            while (x > 0) {
                sum -= bit[x];
                x -= x & -x;
            }
            if (sum < k) {
                item[w]++;
                while (w <= MAX) {
                    bit[w]++;
                    w += w & -w;
                }
            }
        }
        else {
            w = -w;
            if (item[w] > 0) {
                item[w]--;
                while (w <= MAX) {
                    bit[w]--;
                    w += w & -w;
                }
            }
        }
    }
    cout << bit[MAX] << endl;
    return 0;
}