#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template inline string toString(T x) {ostringstream sout;sout< VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef tuple TIII; typedef long long LL; typedef unsigned long long ULL; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MP make_pair #define MT make_tuple #define SZ(a) int((a).size()) #define EACH(i,c) for(auto i: c) #define SORT(c) sort((c).begin(),(c).end()) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() const double EPS = 1e-10; const double PI = acos(-1.0); #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main() { cin.tie(0); ios::sync_with_stdio(false); int N, K; cin >> N >> K; LL ret = 0; const int MAX = 1000001; VI num(MAX, 0); VI bit(MAX, 0); auto sum = [&](int i){ int s = 0; while(i > 0){ s += bit[i]; i -= i & -i; } return s; }; auto add = [&](int i, int x){ while(i <= MAX){ bit[i] += x; i += i & -i; } }; REP(i, N){ int w; cin >> w; if(w > 0){ if(ret - sum(w - 1) >= K) continue; ret++; num[w]++; add(w, 1); } else{ w *= -1; if(num[w] == 0) continue; ret--; num[w]--; add(w, -1); } } cout << ret << endl; return 0; }