class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


N, K = map(int, input().split())

MAX = 1000000
B = Bit(MAX)
for _ in range(N):
    W = int(input())
    if W > 0:
        if B.sum(MAX) - B.sum(W - 1) < K:
            B.add(W, 1)
    else:
        if B.sum(-W) - B.sum(-W - 1):
            B.add(-W, -1)
print(B.sum(MAX))