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

int A[100001];

int main()
{
	int n, k;
	int cnt = 0;
	multiset<int> b;

	cin >> n >> k;

	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		if (a > 0) {
			auto d = lower_bound(b.begin(), b.end(), a);
			if (distance(d, b.end()) < k) {
				A[a]++;
				cnt++;
				b.insert(a);
			}
		}
		else if (a < 0 && A[-a] >= 1) {
			A[-a]--;
			cnt--;
			b.erase(b.find(-a));
		}
	}

	cout << cnt << endl;

    return 0;
}