#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

template<typename T> 
struct BIT{
  int n;
  vector<T> bit;
  //1-indexed
  BIT():n(-1){}
  BIT(int n_,T d):n(n_),bit(n_+1,d){}
  
  T sum(int i){
    T s=bit[0];
    for(int x=i;x>0;x-=(x&-x))
      s+=bit[x];
    return s;
  }
  void add(int i,T a){
    if(i==0) return;
    for(int x=i;x<=n;x+=(x&-x))
      bit[x]+=a;
  }
};

//INSERT ABOVE HERE
signed main(){
  int n,k;
  cin>>n>>k;
  vector<int> w(n);
  for(int i=0;i<n;i++) cin>>w[i];

  const int MAX = 1e6+100;
  BIT<int> bit(MAX,0);
  vector<int> cnt(MAX);  
  int res=0;

  for(int i=0;i<n;i++){
    if(w[i]<0){
      if(cnt[-w[i]]==0) continue;
      cnt[-w[i]]--;
      res--;
      bit.add(-w[i],-1);      
    }
    if(w[i]>0){
      int num=res-bit.sum(w[i]-1);
      if(num>=k) continue;
      cnt[w[i]]++;
      res++;
      bit.add(w[i],1);
    }
  }
  
  cout<<res<<endl;
  return 0;
}