#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    int N, K;
    void input() {
        cin >> N >> K;
    }

    typedef long long Long;
    /* 蛹ｺ髢薙∈縺ｮ荳€讒伜刈邂励↓蟇ｾ蠢懊＠縺欒angeSumQuery */
    struct RangeSumQuery2 {
        // root縺ｮindex縺ｯ1
        int N;
        vector<Long> V, L;
        static int FindPow2(int x) {
            int x1 = 1;
            while (x1 < x) x1 *= 2;
            return x1;
        }
        RangeSumQuery2(int N_) : N(FindPow2(N_)) {
            V = vector<Long>(N * 2, 0);
            L = vector<Long>(N * 2, 0);
        }
        /* [s, t)縺ｫ荳€讒倥↓x繧貞刈邂・*/
        void add(Long x, int s, int t) { return add(x, s, t, 0, N, 1); }
        void add(Long x, int s, int t, int a, int b, int k) {
            if (t <= a || b <= s) return;
            if (s <= a && b <= t) {
                L[k] += x;
                return;
            }
            if (s < b || a < t) {
                V[k] += (min(t, b) - max(s, a)) * x;
                if (b - a == 1) return;
                int m = (a + b) / 2;
                add(x, s, t, a, m, k * 2);
                add(x, s, t, m, b, k * 2 + 1);
            }
        }
        /* [s, t)縺ｮ蜥・*/
        Long query(int s, int t) { return query(s, t, 0, N, 1); }
        Long query(int s, int t, int a, int b, int k) {
            if (t <= a || b <= s) return 0;
            if (s <= a && b <= t) return V[k] + L[k] * (b - a);
            int m = (a + b) / 2;
            return (min(t, b) - max(s, a)) * L[k] +
                query(s, t, a, m, k * 2) +
                query(s, t, m, b, k * 2 + 1);
        }
    };

    void solve() {
        RangeSumQuery2 rsq(1000000 + 1);
        map<int, int> m;
        for (int i = 0; i < N; i++) {
            int W; cin >> W;
            if (W < 0) {
                W = -W;
                if (m[W] == 0) continue;
                rsq.add(-1, 0, W + 1);
                m[W]--;
            } else {
                if (rsq.query(W, W + 1) >= K) continue;
                m[W]++;
                rsq.add(1, 0, W + 1);
            }
        }
        cout << rsq.query(0, 1) << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}