#include<iostream>
#include<set>
using namespace std;

int main(){
    int n, k, w;
    multiset<int> s;

    cin >> n >> k;
    for(int i = 0; i < n; i++){
        cin >> w;
        if(w > 0){
            int bring = distance(s.lower_bound(w), s.end());
            if(bring < k)   s.insert(w);
        }else{
            auto it = s.find(-w);
            if(it != s.end())   s.erase(it);
        }
    }

    cout << s.size() << endl;

    return 0;
}