#define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #define _SILENCE_CXX17_RESULT_OF_DEPRECATION_WARNING #include "bits/stdc++.h" #define rep(i, n) for (int i = 0; i < (n); ++i) #define FOR(i, m, n) for (int i = (m); i < (n); ++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rfor(i, m, n) for (int i = (m); i >= (n); --i) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r) using namespace std; using ll = long long; using ld = long double; using VB = vector; using VVB = vector; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using VS = vector; using VD = vector; using PII = pair; using VP = vector; using PLL = pair; using VPL = vector; templateusing PQ = priority_queue; templateusing PQS = priority_queue, greater>; constexpr int inf = (int)1e9; constexpr ll inf_ll = (ll)1e18, MOD = 1000000007; constexpr ld PI = M_PI, EPS = 1e-12; // --- input --- // #if defined(_WIN32) || defined(ONLINE_JUDGE) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif inline int gc()noexcept { return getchar_unlocked(); } templateinline void InputF(T& v)noexcept { cin >> v; } inline void InputF(char& v)noexcept { while (isspace(v = gc())); } inline void InputF(bool& v)noexcept { char c; InputF(c); v = c == '1'; } inline void InputF(string& v)noexcept { char c; for (InputF(c); !isspace(c); c = gc())v += c; } inline void InputF(int& v)noexcept { bool neg = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc())v = v * 10 + (c - '0'); if (neg)v = -v; } inline void InputF(long long& v)noexcept { bool neg = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc())v = v * 10 + (c - '0'); if (neg)v = -v; } inline void InputF(double& v)noexcept { double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c) || c == '.'; c = gc()) { if (c == '.')adp = true; else if (adp)v += (c - '0') * (dp *= 0.1); else v = v * 10 + (c - '0'); } if (neg)v = -v; } templateinline void InputF(pair& v)noexcept { InputF(v.first); InputF(v.second); } templateinline void InputF(vector& v)noexcept { for (auto& e : v)InputF(e); } templateinline T InputF() { T v; InputF(v); return v; } struct InputV { int n, m; InputV(int N) :n(N), m(0) {} InputV(pair N) :n(N.first), m(N.second) {} templateoperator vector()noexcept { vector v(n); InputF(v); return v; } templateoperator vector>()noexcept { vector> v(n, vector(m)); InputF(v); return v; } }; struct Input { templateoperator T()noexcept { return InputF(); } int operator--(int) { int v; InputF(v); v--; return v; } InputV operator[](int n)noexcept { return InputV(n); } InputV operator[](pair n)noexcept { return InputV(n); } void operator()() {} templatevoid operator()(H&& h, T&& ...t) { InputF(h); operator()(forward(t)...); } templateInput& operator,(T&& v) { InputF(v); return *this; } templatearray, W> get(int H) { array, W> ret; for (int i = 0; i < H; ++i)for (int j = 0; j < W; ++j)ret[j].push_back(InputF()); return ret; } }in; #define input(type) InputF() #define ini input(int) #define inl input(ll) #define ins input(string) // --- output --- // struct BoolStr { const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {} }Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0"); struct DivStr { const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {} }spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", ""); class Output { BoolStr B{ Yes }; DivStr D{ spc }; bool isPrint = true; void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); } void p(int v) { printf("%d", v); } void p(ll v) { printf("%lld", v); } void p(char v) { putchar(v); } void p(bool v) { printf("%s", v ? B.t : B.f); } templatevoid p(const T& v) { cout << v; } templatevoid p(const pair& v) { p(v.first); printf("%s", D.d); p(v.second); } templatevoid p(const vector& v) { rep(i, sz(v)) { if (i)printf("%s", D.d); p(v[i]); } } templatevoid p(const vector>& v) { rep(i, sz(v)) { if (i)printf("%s", D.l); p(v[i]); } } void p(const BoolStr& v) { B = v; isPrint = false; } void p(const DivStr& v) { D = v; isPrint = false; } public: Output& operator()() { printf("%s", D.l); return *this; } templateOutput& operator()(H&& h) { p(h); if (isPrint)printf("%s", D.l); isPrint = true; return *this; } templateOutput& operator()(H&& h, T&& ...t) { p(h); if (isPrint)printf("%s", D.d); isPrint = true; return operator()(forward(t)...); } templatevoid exit(T&& ...t) { operator()(forward(t)...); std::exit(EXIT_SUCCESS); } Output& flush() { cout.flush(); return *this; } Output& set_bs(const char* t, const char* f) { B = BoolStr(t, f); return *this; } }out; // --- dump --- // #if __has_include("dump.hpp") #include "dump.hpp" #else #define dump(...) (void(0)) #endif // --- step --- // templatestruct Step { class It { T a, b, c; public: constexpr It()noexcept : a(T()), b(T()), c(T()) {} constexpr It(T _b, T _c, T _s)noexcept : a(_b), b(_c), c(_s) {} constexpr It& operator++()noexcept { --b; a += c; return *this; } constexpr It operator++(int)noexcept { It tmp = *this; --b; a += c; return tmp; } constexpr const T& operator*()const noexcept { return a; } constexpr const T* operator->()const noexcept { return &a; } constexpr bool operator==(const It& i)const noexcept { return b == i.b; } constexpr bool operator!=(const It& i)const noexcept { return !(b == i.b); } constexpr T start()const noexcept { return a; } constexpr T count()const noexcept { return b; } constexpr T step()const noexcept { return c; } }; constexpr Step(T b, T c, T s)noexcept : be(b, c, s) {} constexpr It begin()const noexcept { return be; } constexpr It end()const noexcept { return en; } constexpr T start()const noexcept { return be.start(); } constexpr T count()const noexcept { return be.count(); } constexpr T step()const noexcept { return be.step(); } operator vector()const noexcept { return as_vector(); } vector as_vector()const noexcept { vector res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res; } templatevoid each(const F& f)const noexcept { for (T i : *this)f(i); } templateauto map(const F& f)const noexcept { vector>> res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res; } templateint count_if(const F& f)const noexcept { int res = 0; each([&](T i) {i += f(i); }); return res; } templatevector select(const F& f)const noexcept { vector res; each([&](T i) {if (f(i))res.push_back(i); }); return res; } templateauto sum(const F& f)const noexcept { decay_t> res = 0; each([&](T i) {res += f(i); }); return res; } using value_type = T; using iterator = It; private: It be, en; }; templateinline constexpr auto step(T a) { return Step(0, a, 1); } templateinline constexpr auto step(T a, T b) { return Step(a, b - a, 1); } templateinline constexpr auto step(T a, T b, T c) { return Step(a, (b - a - 1) / c + 1, c); } inline namespace { templateinline void Sort(T& a)noexcept { sort(all(a)); } templateinline void RSort(T& a)noexcept { sort(rall(a)); } templateinline T Sorted(T a)noexcept { Sort(a); return a; } templateinline T RSorted(T a)noexcept { RSort(a); return a; } templateinline void Sort(T& a, const F& f)noexcept { sort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline void RSort(T& a, const F& f)noexcept { sort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline void Reverse(T& a)noexcept { reverse(all(a)); } templateinline void Unique(T& a)noexcept { a.erase(unique(all(a)), a.end()); } templateinline T Reversed(T a)noexcept { Reverse(a); return a; } templateinline T Uniqued(T a)noexcept { Unique(a); return a; } templateinline auto Max(const T& a)noexcept { return *max_element(all(a)); } templateinline auto Min(const T& a)noexcept { return *min_element(all(a)); } templateinline int MaxPos(const T& a)noexcept { return max_element(all(a)) - a.begin(); } templateinline int MinPos(const T& a)noexcept { return min_element(all(a)) - a.begin(); } templateinline auto Max(const T& a, const F& f)noexcept { return max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline auto Min(const T& a, const F& f)noexcept { return min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline int Count(const T& a, const U& v)noexcept { return count(all(a), v); } templateinline int CountIf(const T& a, const F& f)noexcept { return count_if(all(a), f); } templateinline int Find(const T& a, const U& v)noexcept { return find(all(a), v) - a.begin(); } templateinline int FindIf(const T& a, const F& f)noexcept { return find_if(all(a), f) - a.begin(); } templateinline U Sum(const T& a)noexcept { return accumulate(all(a), U()); } templateinline auto Sum(const T& v, const F& f) { return accumulate(next(v.begin()), v.end(), f(v.front()), [&](auto a, auto b) {return a + f(b); }); } templateinline int Lower(const T& a, const U& v)noexcept { return lower_bound(all(a), v) - a.begin(); } templateinline int Upper(const T& a, const U& v)noexcept { return upper_bound(all(a), v) - a.begin(); } templateinline void RemoveIf(T& a, const F& f)noexcept { a.erase(remove_if(all(a), f), a.end()); } templateinline auto Vector(size_t size, const F& f)noexcept { vector>> res(size); for (size_t i = 0; i < size; ++i)res[i] = f(i); return res; } templateinline auto Grid(size_t h, size_t w, const T& v = T())noexcept { return vector>(h, vector(w, v)); } templateinline auto Slice(const T& v, size_t i, size_t len)noexcept { return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T(); } templateinline auto Select(const T& v, F f)noexcept { T res; for (const auto& e : v)if (f(e))res.push_back(e); return res; } templateinline auto Map(const T& v, const F& f)noexcept { vector>> res(v.size()); size_t i = 0; for (const auto& e : v)res[i++] = f(e); return res; } templateinline auto MapIndex(const T& v, const F& f)noexcept { vector>> res(v.size()); size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it); return res; } templateinline auto TrueIndex(const T& v, const F& f)noexcept { vector res; for (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i); return res; } inline string operator*(string s, size_t n)noexcept { string ret; for (size_t i = 0; i < n; ++i)ret += s; return ret; } templateinline T Age(T n, T m)noexcept { return (n + m - 1) / m; } templateinline T Age2(T n, T m)noexcept { return Age(n, m) * m; } templateinline T Tri(T n)noexcept { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); } templateinline T nC2(T n)noexcept { return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1); } templateinline T Mid(const T& l, const T& r)noexcept { return l + (r - l) / 2; } templateinline int pop_count(T n)noexcept { return bitset<64>(n).count(); } templateinline bool chmax(T& a, const T& b)noexcept { if (a < b) { a = b; return true; } return false; } templateinline bool chmin(T& a, const T& b)noexcept { if (a > b) { a = b; return true; } return false; } templateinline bool inRange(const T& v, const T& min, const T& max)noexcept { return min <= v && v < max; } templateinline T BIT(int b)noexcept { return T{ 1 } << b; } templateinline T Gcd(T n, T m)noexcept { return m ? Gcd(m, n % m) : n; } templateinline T Lcm(T n, T m)noexcept { return n / Gcd(n, m) * m; } templateinline U Gcdv(const T& v)noexcept { return accumulate(next(v.begin()), v.end(), U(*v.begin()), Gcd); } templateinline U Lcmv(const T& v)noexcept { return accumulate(next(v.begin()), v.end(), U(*v.begin()), Lcm); } templateinline T Pow(T a, T n)noexcept { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; } templateinline T Powmod(T a, T n, T m = MOD)noexcept { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; } } // ---------------------------------------------------------------- // templateclass BinaryIndexedTree { int n, n2; vector a; public: BinaryIndexedTree(int n_) :n(n_), a(n_ + 1), n2(1) { while (n2 < n)n2 *= 2; n2 /= 2; } // [0, i] T operator()(int i)const { assert(0 < ++i); T res = 0; for (; i > 0; i -= i & -i)res += a[i]; return res; } // [i, j] T operator()(int i, int j)const { return operator()(j) - (i ? operator()(i - 1) : 0); } void add(int i, T x) { assert(0 < ++i); for (; i <= n; i += i & -i)a[i] += x; } int lower_bound(T k)const { if (k <= 0)return 0; int res = 0; for (int i = n2; i > 0; i /= 2) { if (res + i <= n && a[res + i] < k) { k -= a[res + i]; res += i; } } return res; } vector debug()const { vector res(n); for (int i = 0; i < n; ++i)res[i] = operator()(i, i); return res; } }; int main() { int n = in, k = in; VI w = in[n]; const int MAX_W = 1000005; BinaryIndexedTree bit(MAX_W + 1); for (auto i : w) { if (0 < i) { if (bit(i, MAX_W) < k) { bit.add(i, 1); } } else { if (bit(-i, -i)) bit.add(-i, -1); } } out(bit(0, MAX_W)); }