n, k = map(int, input().split())
MAX_W = 1000010
weights = [0] * (MAX_W + 1)
bit = 0

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

def add_w(i, x):
    while(i <= MAX_W):
        weights[i] += x
        i += i & -i
        
for i in range(n):
    w = int(input())
    if w > 0:
        if sum_w(MAX_W) - sum_w(w - 1) < k:
            add_w(w, 1)
    else:
        if sum_w(-w) - sum_w(-w - 1) >= 1:
            add_w(-w, -1)
            
print(sum_w(MAX_W))