#include <bits/stdc++.h>
using namespace std;

using Int32 = int_fast32_t;
using Word32 = uint_fast32_t;
using Int64 = int_fast64_t;
using Word64 = uint_fast64_t;
using Int128 = __int128_t;
using Word128 = __uint128_t;
using Int = int_fast64_t;
using Word = uint_fast64_t;
using VInt = vector<Int>;
using VVI = vector<VInt>;
using VWord = vector<Word>;
using VVW = vector<VWord>;
using VS = vector<string>;
using VVS = vector<VS>;
using VB = vector<bool>;
using VVB = vector<VB>;
using PII = pair<Int,Int>;
using PWW = pair<Word,Word>;
using VPII = vector<PII>;
using VPWW = vector<PWW>;

#define SZ(x) ((Int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i,n) for(Int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i,n) for(Int i=0, i##_len=(n); i<=i##_len; ++i)
#define Range(i,a,b) for(Int i=(a); i<=(Int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back

struct BIT {
  VInt dat;
  BIT(Int sz) { dat = VInt(sz); }
  void add(Int x, Int y) {
    for (Int i = x; i < SZ(dat); i += i & -i) dat[i] += y;
  }
  Int sum(Int x) {
    Int res = 0;
    for (Int i = x; i > 0; i -= i & -i) res += dat[i];
    return res;
  }
}; 

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  Int N, K;
  cin >> N >> K;
  VInt w(N);
  rep(i,N) cin >> w[i];

  BIT *bit = new BIT(1000001);
  rep(i,N) {
    if (w[i] > 0) {
      if (bit->sum(1000000) - bit->sum(w[i] - 1) >= K) continue;
      bit->add(w[i], 1);
    }
    else {
      if (bit->sum(-w[i]) - bit->sum(-w[i] - 1) > 0) bit->add(-w[i], -1);
    }
  }
  cout << bit->sum(1000000) << '\n';
  delete(bit);
  
  return 0;
}