def query(i):
    s = 0
    
    while i > 0:
        s += BIT[i]
        i -= i & -i
        
    return s

def add(i, x):
    while i <= 1000000:
        BIT[i] += x
        i += i & -i

N, K = map(int, input().split())
BIT = [0] * 1000001

for _ in range(N):
    Wi = int(input())
    
    if Wi > 0 and query(1000000) - query(Wi-1) < K:
        add(Wi, 1)
    elif Wi < 0 and query(-Wi) - query(-Wi-1) > 0:
        add(-Wi, -1)

print(query(1000000))