N,K=map(int,raw_input().split())
bitN=10**6;bit=[0]*(bitN+1);cnt=[0]*(bitN+1)
def bit_add(a,w):
	while a<=bitN:bit[a]+=w;a+=a&(-a)
def bit_sum(a):
	ret=0
	while a>0:ret+=bit[a];a-=a&(-a)
	return ret
for i in xrange(N):
	w=input()
	if w > 0:
		if bit_sum(bitN-w+1)<K:bit_add(bitN-w+1,1);cnt[w]+=1
	else:
		if cnt[-w]>0:bit_add(bitN+w+1,-1);cnt[-w]-=1
print bit_sum(bitN)