#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define itera(a) __typeof(a.begin())
#define FOR(it,a) for(itera(a)it=a.begin();it!=a.end();++it)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define sz(a) SZ(a)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) (a).begin(),(a).end()

using namespace std;

#define PR(...) do{cerr << "line : " << __LINE__ << endl; pr(#__VA_ARGS__, __VA_ARGS__);}while(0);
template<class T>
void pr(const string& name, T t){
  cerr << name << ": " << t << endl;
}

template<typename T, typename ... Types>
void pr(const string& names, T t, Types ... rest) {
  auto comma_pos = names.find(',');
  cerr << names.substr(0, comma_pos) << ": " << t << ", ";
  
  auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);
  pr(string(names, next_name_pos), rest ...);
}

template<class T,class U> ostream& operator<< (ostream& o, const pair<T,U>& v){return o << "(" << v.F << ", " << v.S << ")";}
template<class T> ostream& operator<< (ostream& o, const vector<T>& v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";}


#define endl '\n'


typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;

const int dx[] = {0,1,0,-1};
const int dy[] = {1,0,-1,0};


class BIT{
  vector<int> bit;
  int n;
public:
  BIT(int N):bit(N),n(N){};

  void add(int i,int v){
    for(; i < n; i |= i+1)
      bit[i] += v;
  }
  
  int sum(int i){// sum of [0...i)
    int res = 0;
    --i;
    for(; i >= 0; i = (i & (i + 1)) - 1)
      res += bit[i];
    return res;
  }
};

int main(int argc, char *argv[])
{
	int n,k;
	cin >> n >> k;
	BIT bit(1100000);
	rep(i,n){
		int w;
		cin >> w;
		if(w < 0){
			if(bit.sum(-w+1)-bit.sum(-w)) bit.add(-w,-1);
		}else{
			if(bit.sum(1100000-10)-bit.sum(w) >= k) continue;
			bit.add(w,1);
		}
	}

	cout << bit.sum(1100000-10) << endl;
	return 0;
}