class BIT: #0-indexed
    __slots__ = ["size", "tree","depth","n0"]
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
        self.depth = n.bit_length()
        self.n0 = 1<<self.depth

    def get_sum(self, i): #a_0 + ... + a_{i} #閉区間
        s = 0; i += 1
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def range_sum(self,l,r): #a_l + ... + a_r 閉区間
        return self.get_sum(r) - self.get_sum(l-1) 

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

    def range_sum_larger(self,l): #a_l + ... (端まで)
        return self.get_sum(self.size-1) - (self.get_sum(l-1) if l else 0)
        

n,k = map(int,input().split())
bit = BIT(10**6+1)
num = [0]*(10**6+1)
for _ in range(n):
    w = int(input())
    if w < 0:
        w = -w
        if num[w]:
            num[w] -= 1
            bit.add(w,-1)
    else:
        if bit.range_sum_larger(w) < k:
            num[w] += 1
            bit.add(w,1)
print(bit.range_sum_larger(0))