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

template <typename T>
struct BinaryIndexedTree {
    vector<T> data;
    int n;
    BinaryIndexedTree(int n_) : n(n_ + 1), data(n_ + 1, 0) {}
    T sum(int i) {
        T ret(0);
        for (int x = i; x > 0; x -= x & -x)
            ret += data[x];
        return ret;
    }
    void add(int i, T a) {
        for (int x = i; x <= n; x += x & -x)
            data[x] += a;
    }
};

int main() {
    int N, K, W[100010];
    cin >> N >> K;
    for (int i = 0; i < N; i++) {
        cin >> W[i];
    }

    int cnt[100020] = {};
    BinaryIndexedTree<int> bit(100020);
    int MAX = 100010;

    for (int i = 0; i < N; i++) {
        if (W[i] > 0) {
            if (bit.sum(MAX) - bit.sum(W[i] - 1) < K) {
                bit.add(W[i], 1);
                cnt[W[i]]++;
            }
        } else {
            W[i] *= -1;
            if (cnt[W[i]]) {
                cnt[W[i]]--;
                bit.add(W[i], -1);
            }
        }
    }
    cout << bit.sum(MAX) << endl;
}