// line 1 "answer.cpp" #if !__INCLUDE_LEVEL__ #include __FILE__ int main() { ll q,k; input(q,k); vector query(q); vl coordinates; rep(i, q) { ll t; input(t); ll x; if (t == 1) { input(x); coordinates.push_back(x); } query[i] = make_pair(t, x); } Compress c(coordinates); Bit bit(sz(c)); repe(q, query) { auto [t, x] = q; if (t == 1) { bit.set(c.pos(x), 1+bit.get(c.pos(x))); } else { if (bit.sum(sz(c)) < k) { print(-1); continue; } ll p = bit.lower_bound(k); print(c.key_at(p)); bit.add(p, -1); } } } #else // line 2 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp" #include #ifndef LOCAL_TEST #pragma GCC target ("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #endif // LOCAL_TEST using namespace std; // 型名の短縮 using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vc = vector; using vvc = vector; using vvvc = vector; using vd = vector; using vvd = vector; using vvvd = vector; using vs = vector; using vvs = vector>; using vvvs = vector>>; template vector> vv(int h, int w, T val = T()) { return vector(h, vector(w, val)); } template vector>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector(h3, val))); } template vector>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector(h4, val)))); } template using priority_queue_min = priority_queue, greater>; // 定数の定義 constexpr double PI = 3.14159265358979323; constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL; float EPS = 1e-8; double EPSL = 1e-16; template bool eq(const T x, const T y) { return x == y; } template<> bool eq(const double x, const double y) { return abs(x - y) < EPSL; } template<> bool eq(const float x, const float y) { return abs(x - y) < EPS; } template bool neq(const T x, const T y) { return !(eq(x, y)); } template bool ge(const T x, const T y) { return (eq(x, y) || (x > y)); } template bool le(const T x, const T y) { return (eq(x, y) || (x < y)); } template bool gt(const T x, const T y) { return !(le(x, y)); } template bool lt(const T x, const T y) { return !(ge(x, y)); } constexpr int MODINT998244353 = 998244353; constexpr int MODINT1000000007 = 1000000007; // 入出力高速化 struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan; // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((ll)(x).size()) #define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順 #define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順 #define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順 #define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define repe(a, v) for(auto& a : (v)) // v の全要素(変更可能) #define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod #define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去 void Yes(bool b) { cout << (b ? "Yes\n" : "No\n"); return; }; void YES(bool b) { cout << (b ? "YES\n" : "NO\n"); return; }; template T max(array& a) { return *max_element(all(a)); }; template T min(array& a) { return *min_element(all(a)); }; template T max(vector& a) { return *max_element(all(a)); }; template T min(vector& a) { return *min_element(all(a)); }; template T sum(vector& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; }; template bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; }; template inline vector& operator--(vector& v) { repe(x, v) --x; return v; } template inline vector& operator++(vector& v) { repe(x, v) ++x; return v; } // modでのpow ll powm(ll a, ll n, ll mod=INFL) { ll res = 1; while (n > 0) { if (n & 1) res = (res * a) % mod; if (n > 1) a = (a * a) % mod; n >>= 1; } return res; } // 整数Sqrt ll sqrtll(ll x) { assert(x >= 0); ll rev = sqrt(x); while(rev * rev > x) --rev; while((rev+1) * (rev+1)<=x) ++rev; return rev; } template inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数 /** * @brief std.hpp * @docs docs/std/std.md */ // line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/helper/compress.hpp" template struct Compress { vector coordinates; vector val; Compress() = default; Compress(const vector &_coordinates, Val default_val = Val(0)) { coordinates = _coordinates; uniq(coordinates); sort(all(coordinates)); val = vector(sz(coordinates), default_val); } int pos(const Key key) const { auto iter = lower_bound(all(coordinates), key); assert(iter != coordinates.end() && *iter == key); return distance(coordinates.begin(), iter); } Val &operator[](const Key key) { return val[pos(key)]; } Key key_at(const int i) const { return coordinates[i]; } size_t size() const { return coordinates.size(); } }; /** * @brief 座標圧縮 * @docs docs/helper/compress.md */ // line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/data_structure/bit.hpp" template struct Bit { vector bit; int _n; Bit(int size, T val = T(0)) : _n(size), bit(size+1, val) {} Bit(const vector val) : _n(sz(val)), bit(sz(val)+1, T(0)) { rep(i, _n) set(i, val[i]); } void add(int p, T x) { assert(0 <= p && p <= _n); p++; for (int i = p; i <= _n; i += i & -i) { bit[i] += x; } } T sum(int r) const { assert(0 <= r && r <= _n); T ret = 0; for (int i = r; i > 0; i -= i & -i){ ret += bit[i]; } return ret; } T sum(int l, int r) const { return sum(r) - sum(l); } T get(int p) const { assert(0 <= p && p < _n); return sum(p, p+1); } void set(int p, T x) { assert(0 <= p && p < _n); add(p, x - get(p)); } int lower_bound(T w) const { if (w <= 0) return 0; int x = 0; for (int k = 1 << __lg(_n); k; k >>= 1) { if (x + k <= _n && bit[x + k] < w) { w -= bit[x + k]; x += k; } } return x; } int upper_bound(T w) const { if (w < 0) return 0; int x = 0; for (int k = 1 << __lg(_n); k; k >>= 1) { if (x + k <= _n && bit[x + k] <= w) { w -= bit[x + k]; x += k; } } return x; } }; template std::ostream& operator<<(std::ostream& os, const Bit bit) { rep(i, bit._n) { os << bit.get(i); if (i != bit._n-1) os << " "; } return os; }; /** * @brief BIT(Binary Index Tree) * @docs docs/data_structure/bit.md */ // line 3 "/Users/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp" // 演算子オーバーロード(プロトタイプ宣言) template inline istream& operator>>(istream& is, pair& p); template inline istream& operator>>(istream& is, vector& v); template inline ostream& operator<<(ostream& os, const pair& p); template inline ostream& operator<<(ostream& os, const vector& v); template ostream &operator<<(ostream &os, const map &mp); template ostream &operator<<(ostream &os, const set &st); template ostream &operator<<(ostream &os, const multiset &st); template ostream &operator<<(ostream &os, queue q); template ostream &operator<<(ostream &os, deque q); template ostream &operator<<(ostream &os, stack st); template ostream &operator<<(ostream &os, priority_queue pq); // 演算子オーバーロード template inline istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } template inline istream& operator>>(istream& is, vector& v) { repe(x, v) is >> x; return is; } template inline ostream& operator<<(ostream& os, const pair& p) { os << p.first << " " << p.second; return os; } template inline ostream& operator<<(ostream& os, const vector& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; } template ostream &operator<<(ostream &os, const map &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; } template ostream &operator<<(ostream &os, const set &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, const multiset &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; } template void print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; }; template void print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) { cout << val << sep; print_sep_end(sep, end, remain...); }; template void print(const T &...args) { print_sep_end(" ", "\n", args...); }; template void flush() { cout << flush; }; template void print_and_flush(const T &...args) { print(args...); flush(); }; #define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print template void input(T &a) { cin >> a; }; template void input(T1&a, T2 &...b) { cin >> a; input(b...); }; #ifdef LOCAL_TEST template void debug_func(int i, T name) { (void)i; (void)name; cerr << endl; } template void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) { int scope = 0; for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) { cerr << name[i]; if (name[i] == '(' || name[i] == '{') scope++; if (name[i] == ')' || name[i] == '}') scope--; } cerr << ":" << a << " "; debug_func(i + 1, name, b...); } #endif #ifndef LOCAL_TEST template void debug_func(const T &...) {} #endif /** * @brief io.hpp * @docs docs/std/io.md */ // line 40 "answer.cpp" #endif