// Problem: No.3303 Heal Slimes 2 // Contest: yukicoder // URL: https://yukicoder.me/problems/no/3303 // Memory Limit: 512 MB // Time Limit: 4000 ms // // Powered by CP Editor (https://cpeditor.org) #line 2 "/root/AtCoder/Halc-Library/Template/Template.hpp" #include using namespace std; #line 8 "/root/AtCoder/Halc-Library/Template/InOut.hpp" inline void scan() {} inline void scan(int32_t &a) { std::cin >> a; } inline void scan(uint32_t &a) { std::cin >> a; } inline void scan(int64_t &a) { std::cin >> a; } inline void scan(uint64_t &a) { std::cin >> a; } inline void scan(char &a) { std::cin >> a; } inline void scan(float &a) { std::cin >> a; } inline void scan(double &a) { std::cin >> a; } inline void scan(long double &a) { std::cin >> a; } inline void scan(std::vector &vec) { for (int32_t i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } } inline void scan(std::string &a) { std::cin >> a; } template inline void scan(std::vector &vec); template inline void scan(std::array &vec); template inline void scan(std::pair &p); template inline void scan(T (&vec)[size]); template inline void scan(std::vector &vec) { for (auto &i : vec) scan(i); } template inline void scan(std::deque &vec) { for (auto &i : vec) scan(i); } template inline void scan(std::array &vec) { for (auto &i : vec) scan(i); } template inline void scan(std::pair &p) { scan(p.first); scan(p.second); } template inline void scan(T (&vec)[size]) { for (auto &i : vec) scan(i); } template inline void scan(T &a) { std::cin >> a; } inline void in() {} template inline void in(Head &head, Tail &...tail) { scan(head); in(tail...); } inline void print() { std::cout << ' '; } inline void print(const bool &a) { std::cout << a; } inline void print(const int32_t &a) { std::cout << a; } inline void print(const uint32_t &a) { std::cout << a; } inline void print(const int64_t &a) { std::cout << a; } inline void print(const uint64_t &a) { std::cout << a; } inline void print(const char &a) { std::cout << a; } inline void print(const char a[]) { std::cout << a; } inline void print(const float &a) { std::cout << a; } inline void print(const double &a) { std::cout << a; } inline void print(const long double &a) { std::cout << a; } inline void print(const std::string &a) { for (auto &&i : a) print(i); } template inline void print(const std::vector &vec); template inline void print(const std::array &vec); template inline void print(const std::pair &p); template inline void print(const T (&vec)[size]); template inline void print(const std::vector &vec) { if (vec.empty()) return; print(vec[0]); for (auto i = vec.begin(); ++i != vec.end();) { std::cout << ' '; print(*i); } } template inline void print(const std::deque &vec) { if (vec.empty()) return; print(vec[0]); for (auto i = vec.begin(); ++i != vec.end();) { std::cout << ' '; print(*i); } } template inline void print(const std::array &vec) { print(vec[0]); for (auto i = vec.begin(); ++i != vec.end();) { std::cout << ' '; print(*i); } } template inline void print(const std::pair &p) { print(p.first); std::cout << ' '; print(p.second); } template inline void print(const T (&vec)[size]) { print(vec[0]); for (auto i = vec; ++i != end(vec);) { std::cout << ' '; print(*i); } } template inline void print(const T &a) { std::cout << a; } inline void out() { std::cout << '\n'; } template inline void out(const T &t) { print(t); std::cout << '\n'; } template inline void out(const Head &head, const Tail &...tail) { print(head); std::cout << ' '; out(tail...); } inline void Yes(bool i = true) { out(i ? "Yes" : "No"); } inline void No(bool i = true) { out(i ? "No" : "Yes"); } inline void Takahashi(bool i = true) { out(i ? "Takahashi" : "Aoki"); } inline void Aoki(bool i = true) { out(i ? "Aoki" : "Takahashi"); } inline void Alice(bool i = true) { out(i ? "Alice" : "Bob"); } inline void Bob(bool i = true) { out(i ? "Bob" : "Alice"); } inline void First(bool i = true) { out(i ? "First" : "Second"); } inline void Second(bool i = true) { out(i ? "Second" : "First"); } inline void Possible(bool i = true) { out(i ? "Possible" : "Impossible"); } inline void Impossible(bool i = true) { out(i ? "Impossible" : "Possible"); } inline void fls() { std::flush(std::cout); } struct IOsetup { IOsetup() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(16); } } iosetup; #line 9 "/root/AtCoder/Halc-Library/Template/Util.hpp" using ll = int64_t; using ld = long double; using ull = uint64_t; using uint = uint32_t; using pll = std::pair; using pii = std::pair; using vl = std::vector; using vvl = std::vector>; using pdd = std::pair; using tuplis = std::array; template using pq = std::priority_queue, std::greater>; constexpr ll LINF = (1LL << 62) - (1LL << 31); constexpr int32_t INF = INT_MAX >> 1; constexpr ll MINF = 1LL << 40; constexpr ld DINF = std::numeric_limits::infinity(); constexpr int32_t MODD = 1000000007; constexpr int32_t MOD = 998244353; constexpr ld EPS = 1e-9; constexpr ld PI = 3.1415926535897932; const ll four[] = {0, 1, 0, -1, 0}; const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0}; template bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } else return false; } template ll sum(const T &a) { return accumulate(std::begin(a), std::end(a), 0LL); } template ld dsum(const T &a) { return accumulate(std::begin(a), std::end(a), 0.0L); } template auto min(const T &a) { return *min_element(std::begin(a), std::end(a)); } template auto max(const T &a) { return *max_element(std::begin(a), std::end(a)); } #line 1 "/root/AtCoder/Halc-Library/Template/Macro.hpp" #define _overload3(_1, _2, _3, name, ...) name #define _overload4(_1, _2, _3, _4, name, ...) name #define _rep1(i, n) for (int64_t i = 0; i < (n); i++) #define _rep2(i, a, b) for (int64_t i = (a); i < (b); i++) #define _rep3(i, a, b, c) for (int64_t i = (a); i < (b); i += (c)) #define rep(...) _overload4(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS__) #define _rrep1(i, n) for (int64_t i = (n) - 1; i >= 0; i--) #define _rrep2(i, a, b) for (int64_t i = (b) - 1; i >= (a); i--) #define rrep(...) _overload3(__VA_ARGS__, _rrep2, _rrep1)(__VA_ARGS__) #define each(i, ...) for (auto&& i : __VA_ARGS__) #define all(i) std::begin(i), std::end(i) #define rall(i) std::rbegin(i), std::rend(i) #define len(x) ((int64_t)(x).size()) #define fi first #define se second #define uniq(x) x.erase(unique(all(x)), std::end(x)) #define vec(type, name, ...) vector name(__VA_ARGS__); #define vv(type, name, h, ...) std::vector> name(h, std::vector(__VA_ARGS__)); #define INT(...) int32_t __VA_ARGS__; in(__VA_ARGS__) #define LL(...) int64_t __VA_ARGS__; in(__VA_ARGS__) #define ULL(...) uint64_t __VA_ARGS__; in(__VA_ARGS__) #define STR(...) std::string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define LD(...) long double __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) std::vector name(size); in(name) #define VV(type, name, h, w) std::vector> name(h, std::vector(w)); in(name) #line 2 "main.cpp" multiset X,Y; ll K; void balance(){ while(X.size()K){ Y.insert(*X.begin()); X.erase(X.find(*X.begin())); } while(*X.begin()<*Y.rbegin()){ ll xb=*X.begin(),yb=*Y.rbegin(); X.erase(X.find(xb));Y.erase(Y.find(yb)); X.insert(yb);Y.insert(xb); } } void add(ll v){ Y.insert(v); balance(); } void erase(ll v){ if(X.count(v))X.erase(X.find(v)); else Y.erase(Y.find(v)); balance(); } void solve() { LL(N);in(K);LL(Q); VEC(ll,A,N); rep(i,N)X.insert(-A[i]); rep(i,100)X.insert(-LINF); balance(); rep(i,Q){ LL(t); ll k=*X.begin(); if(t==1){ LL(x); add(-x); } if(t==2){ LL(x); k-=x; add(k); erase(k+x); } if(t==3){ out(-k); } } } int main() { solve(); }