#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
struct BinaryIndexedTree{
    vector<int> bit;
    BinaryIndexedTree(int siz){
        bit.assign(++siz,0);
    }

    int sum(int k){
        int ret=0;
        for(++k;k>0;k-=k&-k){
            ret+=bit[k];
        }
        return ret;
    }

    void add(int k,int x){
        for(++k;k<(int)bit.size();k+=k&-k){
            bit[k]+=x;
        }
    }
};
int main(){
	int n,k;cin>>n>>k;
	int w[100010];
	BinaryIndexedTree bit(1000010);
	for(int i=0;i<n;i++){
		cin>>w[i];
	}
	for(int i=0;i<n;i++){
		if(w[i]<0){
			if(bit.sum(-w[i])-bit.sum(-w[i]-1)<=0)continue;
			bit.add(-w[i],-1);
		}else{
			if(bit.sum(1000000)-bit.sum(w[i]-1)<k){
				bit.add(w[i],1);
			}
		}
	}
	cout<<bit.sum(100000)<<endl;
	return 0;
}