#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace std;
#define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++)
#define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++)
#define all(n) (n).begin(),(n).end()
typedef long long ll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<long long,long long> Pii;
typedef vector<Pii> VPii;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> set2;
int main(){
	int N,K;
	cin >> N >> K;
	set2 S;

	rep(i,N){
		int W;
		cin >> W;
		if( W > 0 ){
			int num = S.size() - S.order_of_key({W,-1});
			if( num < K ){
				S.insert({W,i});
			}
		}else{
			W = -W;
			auto key = S.lower_bound({W,-1});
			if( key != S.end() && key->first == W ) S.erase(*key);
		}
	}
	cout << S.size() << endl;
}