#include #include using namespace std; namespace my{ #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define VL(n,...) vec__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__) #define FO(n) for(ll ij=n;ij-->0;) #define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i=i##stop;i+=i##step) #define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a) #define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{ void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;} constexpr char newline=10; constexpr char space=32; bool amin(auto&a,const auto&b){return a>b?a=b,1:0;} templateostream&operator<<(ostream&o,const tuple&t){apply([&](const auto&...a){ll i=sizeof...(a);(((o<0,space))),...);},t);return o;} templateostream&operator<<(ostream&o,const multiset&s){fe(s,e)o<struct multiset:std::multiset{ multiset(const initializer_list&a={}){fe(a,e)this->emplace(e);} multiset(const vector&a){fe(a,e)this->emplace(e);} }; templateconcept vectorial=is_base_of_v,V>; templatestruct vec_attr{using core_type=T;static constexpr int d=0;}; templatestruct vec_attr{using core_type=typename vec_attr::core_type;static constexpr int d=vec_attr::d+1;}; templateusing core_t=vec_attr::core_type; templateistream&operator>>(istream&i,vector&v){fe(v,e)i>>e;return i;} templateostream&operator<<(ostream&o,const vector&v){fe(v,e)o<?newline:space);return o;} templatestruct vec:vector{ using vector::vector; vec(const vector&v){vector::operator=(v);} templaterequires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;ll s[n];ll i=0;((i(tuple{a...}));} templatestatic auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec(s[i],x);else{auto X=make_vec(s,x);return vec(s[i],X);}} vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;} vec operator^(const vec&u)const{return vec{*this}^=u;} vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;} vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;} vec operator+(const vec&u)const{return vec{*this}+=u;} vec operator-(const vec&u)const{return vec{*this}-=u;} vec&operator++(){fe(*this,e)++e;return*this;} vec&operator--(){fe(*this,e)--e;return*this;} vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;} }; templatestruct dvec_helper{using type=vec::type>;}; templatestruct dvec_helper<0,T>{using type=T;}; templateusing dvec=typename dvec_helper::type; templaterequires(sizeof...(A)>=2)vec(A...a)->vec(declval>()))>>>; vec(ll)->vec; templatevoid setsize(const ll(&l)[n],A&...a){((a=vec::make_vec(l,core_t{})),...);} void lin(auto&...a){(cin>>...>>a);} templatestruct kth_multiset{ ll K; multisetpre,suf; kth_multiset(ll K):K(K){} void emplace(T x,const auto&add,const auto&del){ if((ll)pre.size()=*p){ suf.emplace(x); return; } suf.emplace(*p); del(*p); pre.erase(p); pre.emplace(x); add(x); } friend ostream&operator<<(ostream&o,const kth_multiset&s){return o<void pp(const auto&...a){ll n=sizeof...(a);((cout<0,c)),...);cout<st(K-1); ll ans=0; of(i,N,1){ if(i&1)amin(ans,su+a[i]); st.emplace(a[i],add,del); } pp(-ans); }}