#include <iostream>
#include <vector>
using namespace std;

template <class T>
class BIT {
  int N;
  vector<T> dat;
 public:
  explicit BIT(int n) : N(n+2), dat(N) {}
  void add(int k, T x) {
    for(int i=k+1; i<N; i+=i&-i) { dat[i] += x; }
  }
  T sum(int k) {
    T res = 0;
    for(int i=k; i; i-=i&-i) { res += dat[i]; }
    return res;
  }
};

constexpr int MAX_W = 1'000'005;

int main(void) {
  int N, K; scanf("%d%d", &N, &K);
  BIT<int> tree(MAX_W);
  int cnt;
  for(int i=0; i<N; ++i) {
    int wi; scanf("%d", &wi);
    if(wi > 0) {
      cnt = tree.sum(MAX_W) - tree.sum(wi);
      if(cnt < K) {
        tree.add(wi, 1);
      }
    } else {
      cnt = tree.sum(-wi+1) - tree.sum(-wi);
      if(cnt) {
        tree.add(-wi, -1);
      }
    }
  }
  int res = tree.sum(MAX_W);
  printf("%d\n", res);
  return 0;
}