# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

int n, k;
int w[101010];
struct BIT {
	vector<LL> bit;
	BIT(LL n) {
		bit.resize(n + 10);
		for (int i = 0; i < n + 10; i++)bit[i] = 0;
	}
	//[0,i)
	LL sum(int i) {
		LL s = 0;
		for (int x = i - 1; x >= 0; x = (x&(x + 1)) - 1) {
			s += bit[x];
		}
		return s;
	}
	void add(int a, LL w) {
		for (int x = a; x < (int)bit.size(); x |= x + 1) {
			bit[x] += w;
		}
	}
};


int cnt = 0;

int main(){
    INIT;
    cin >> n >> k;
    BIT bit(101010);
    REP(i, n){
        cin >> w[i];
        if(w[i] > 0){
            if(cnt - bit.sum(w[i]) >= k)continue;
            cnt++;
            bit.add(w[i], 1);
        }else{
            w[i] *= -1;
            if(bit.sum(w[i] + 1) - bit.sum(w[i]) > 0){
                bit.add(w[i], -1);
                cnt--;
            }
        }
    }
    cout << cnt << endl;
}