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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12

template<class T> struct BinaryIndexedTree
{
private:
  vector<T> data;
  int n;

public:
  BinaryIndexedTree(const int size) : data(size+1, 0), n(size) {}
  T sum(int i){
    T s = 0;
    while(i > 0){
      s += data[i];
      i -= i & -i;
    }
    return s;
  }
  T sum(int i, int j){ return sum(j) - sum(i - 1); }
  T get(int i){ return sum(i) - sum(i-1); }
  void add(int i, T x){
    while(i <= n){
      data[i] += x;
      i += i & -i;
    }
  }
};

const int MAX_N = 100000;
int N, K;
int W[MAX_N];
int res;
int mw;

int main()
{
  cin >> N >> K;
  rep(i, N) cin >> W[i];
  rep(i, N) maxup(mw, abs(W[i]));

  BinaryIndexedTree<int> BIT(mw);
  rep(i, N){
    if(W[i] > 0 && BIT.sum(mw) - BIT.sum(W[i]-1) < K) BIT.add(W[i], 1);
    if(W[i] < 0 && BIT.get(-W[i]) > 0) BIT.add(-W[i], -1);
  }

  erep(i, 1, mw) res += BIT.get(i);

  cout << res << endl;

  return 0;
}