#line 1 "/home/maspy/compro/library/my_template.hpp" #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using pi = pair; using vi = vector; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; #define vec(type, name, ...) vector name(__VA_ARGS__) #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c)) #define overload4(a, b, c, d, e, ...) e #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) \ overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s)) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll template T SUM(const vector &A) { T sum = 0; for (auto &&a: A) sum += a; return sum; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()) int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template T pick(deque &que) { T a = que.front(); que.pop_front(); return a; } template T pick(pq &que) { T a = que.top(); que.pop(); return a; } template T pick(pqg &que) { assert(que.size()); T a = que.top(); que.pop(); return a; } template T pick(vc &que) { assert(que.size()); T a = que.back(); que.pop_back(); return a; } template T ceil(T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); } template T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); } template pair divmod(T x, U y) { T q = floor(x, y); return {q, x - q * y}; } template ll binary_search(F check, ll ok, ll ng) { assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return ok; } template double binary_search_real(F check, double ok, double ng, int iter = 100) { FOR(iter) { double x = (ok + ng) / 2; tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x)); } return (ok + ng) / 2; } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } vc s_to_vi(const string &S, char first_char) { vc A(S.size()); FOR(i, S.size()) { A[i] = S[i] - first_char; } return A; } template vector cumsum(vector &A, int off = 1) { int N = A.size(); vector B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } template vc bincount(const vc &A, int size) { vc C(size); for (auto &&x: A) { ++C[x]; } return C; } // stable template vector argsort(const vector &A) { vector ids(A.size()); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); }); return ids; } // A[I[0]], A[I[1]], ... template vc rearrange(const vc &A, const vc &I) { int n = len(I); vc B(n); FOR(i, n) B[i] = A[I[i]]; return B; } #line 1 "/home/maspy/compro/library/other/io.hpp" // based on yosupo's fastio #include namespace detail { template std::true_type check_value(int); template std::false_type check_value(long); } // namespace detail template struct is_modint : decltype(detail::check_value(0)) {}; template using is_modint_t = enable_if_t::value>; template using is_not_modint_t = enable_if_t::value>; struct Scanner { FILE *fp; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += fread(line + ed, 1, (1 << 15) - ed, fp); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template * = nullptr> bool read_single(T &ref) { long long val = 0; bool f = read_single(val); ref = T(val); return f; } bool read_single(double &ref) { string s; if (!read_single(s)) return false; ref = std::stod(s); return true; } bool read_single(char &ref) { string s; if (!read_single(s) || s.size() != 1) return false; ref = s[0]; return true; } template bool read_single(vector &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template bool read_single(pair &p) { return (read_single(p.first) && read_single(p.second)); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p))); } template bool read_single(tuple &p) { return (read_single(get<0>(p)) && read_single(get<1>(p)) && read_single(get<2>(p)) && read_single(get<3>(p))); } void read() {} template void read(H &h, T &... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE *fp) : fp(fp) {} }; struct Printer { Printer(FILE *_fp) : fp(_fp) {} ~Printer() { flush(); } static constexpr size_t SIZE = 1 << 15; FILE *fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write(const char &val) { if (pos == SIZE) flush(); line[pos++] = val; } template ::value, int> = 0> void write(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write('0'); return; } if (val < 0) { write('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write(const string &s) { for (char c: s) write(c); } void write(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write(s[i]); } void write(const double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } void write(const long double &x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } template * = nullptr> void write(T &ref) { write(ref.val); } template void write(const vector &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template void write(const pair &val) { write(val.first); write(' '); write(val.second); } template void write(const tuple &val) { auto &[a, b, c] = val; write(a), write(' '), write(b), write(' '), write(c); } template void write(const tuple &val) { auto &[a, b, c, d] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d); } template void write(const tuple &val) { auto &[a, b, c, d, e] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e); } template void write(const tuple &val) { auto &[a, b, c, d, e, f] = val; write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f); } template void write(const array &val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } void write(i128 val) { string s; bool negative = 0; if(val < 0){ negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if(negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } }; Scanner scanner = Scanner(stdin); Printer printer = Printer(stdout); void flush() { printer.flush(); } void print() { printer.write('\n'); } template void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward(tail)...); } void read() {} template void read(Head &head, Tail &... tail) { scanner.read(head); read(tail...); } #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector name(size); \ read(name) #define VV(type, name, h, w) \ vector> name(h, vector(w)); \ read(name) void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 1 "/home/maspy/compro/library/ds/fastset.hpp" /* 64分木。 insert, erase []での存在判定 next, prev */ struct FastSet { using uint = unsigned; using ull = unsigned long long; int bsr(ull x) { return 63 - __builtin_clzll(x); } int bsf(ull x) { return __builtin_ctzll(x); } static constexpr uint B = 64; int n, lg; vector> seg; FastSet(int _n) : n(_n) { do { seg.push_back(vector((_n + B - 1) / B)); _n = (_n + B - 1) / B; } while (_n > 1); lg = int(seg.size()); } bool operator[](int i) const { return (seg[0][i / B] >> (i % B) & 1) != 0; } void insert(int i) { for (int h = 0; h < lg; h++) { seg[h][i / B] |= 1ULL << (i % B); i /= B; } } void erase(int i) { for (int h = 0; h < lg; h++) { seg[h][i / B] &= ~(1ULL << (i % B)); if (seg[h][i / B]) break; i /= B; } } // x以上最小の要素を返す。存在しなければ n。 int next(int i) { for (int h = 0; h < lg; h++) { if (i / B == seg[h].size()) break; ull d = seg[h][i / B] >> (i % B); if (!d) { i = i / B + 1; continue; } // find i += bsf(d); for (int g = h - 1; g >= 0; g--) { i *= B; i += bsf(seg[g][i / B]); } return i; } return n; } // x以下最大の要素を返す。存在しなければ -1。 int prev(int i) { if (i < 0) return -1; if (i >= n) i = n - 1; for (int h = 0; h < lg; h++) { if (i == -1) break; ull d = seg[h][i / B] << (63 - i % 64); if (!d) { i = i / B - 1; continue; } // find i += bsr(d) - (B - 1); for (int g = h - 1; g >= 0; g--) { i *= B; i += bsr(seg[g][i / B]); } return i; } return -1; } // [l, r) 内の要素を全部集める vector collect(int l, int r) { vector res; int x = l - 1; while (1) { x = next(x + 1); if (x >= r) break; res.emplace_back(x); } return res; } void debug() { string s; for (int i = 0; i < n; ++i) s += ((*this)[i] ? '1' : '0'); print(s); } }; #line 2 "/home/maspy/compro/library/ds/segtree.hpp" template struct SegTree { using X = typename Monoid::value_type; using value_type = X; vector dat; int n, log, size; SegTree() : SegTree(0) {} SegTree(int n) : SegTree(vector(n, Monoid::unit())) {} SegTree(vector v) : n(v.size()) { log = 1; while ((1 << log) < n) ++log; size = 1 << log; dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = v[i]; for (int i = size - 1; i >= 1; --i) update(i); } template SegTree(int n, F f) : n(n) { log = 1; while ((1 << log) < n) ++log; size = 1 << log; dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = f(i); for (int i = size - 1; i >= 1; --i) update(i); } void reset() { fill(all(dat), Monoid::unit()); } void set_all(const vector& v) { dat.assign(size << 1, Monoid::unit()); for (int i = 0; i < n; ++i) dat[size + i] = v[i]; for (int i = size - 1; i >= 1; --i) update(i); } X operator[](int i) { return dat[size + i]; } void update(int i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); } void set(int i, const X& x) { assert(i < n); dat[i += size] = x; while (i >>= 1) update(i); } void multiply(int i, const X& x) { assert(i < n); i += size; dat[i] = Monoid::op(dat[i], x); while (i >>= 1) update(i); } X prod(int L, int R) { assert(L <= R); assert(R <= n); X vl = Monoid::unit(), vr = Monoid::unit(); L += size, R += size; while (L < R) { if (L & 1) vl = Monoid::op(vl, dat[L++]); if (R & 1) vr = Monoid::op(dat[--R], vr); L >>= 1, R >>= 1; } return Monoid::op(vl, vr); } X prod_all() { return dat[1]; } template int max_right(F& check, int L) { assert(0 <= L && L <= n && check(Monoid::unit())); if (L == n) return n; L += size; X sm = Monoid::unit(); do { while (L % 2 == 0) L >>= 1; if (!check(Monoid::op(sm, dat[L]))) { while (L < size) { L = 2 * L; if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L]); L++; } } return L - size; } sm = Monoid::op(sm, dat[L]); L++; } while ((L & -L) != L); return n; } template int min_left(F& check, int R) { assert(0 <= R && R <= n && check(Monoid::unit())); if (R == 0) return 0; R += size; X sm = Monoid::unit(); do { --R; while (R > 1 && (R % 2)) R >>= 1; if (!check(Monoid::op(dat[R], sm))) { while (R < size) { R = 2 * R + 1; if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R], sm); R--; } } return R + 1 - size; } sm = Monoid::op(dat[R], sm); } while ((R & -R) != R); return 0; } // モノイドが可換なら、prod_{l<=i= r) break; if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); } if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); } l /= 2, r /= 2, xor_val /= 2; } return x; } void debug() { print("segtree", dat); } }; #line 2 "/home/maspy/compro/library/alg/monoid/min.hpp" template struct Monoid_Min { using value_type = X; static constexpr X op(const X &x, const X &y) noexcept { return min(x, y); } static constexpr X unit() { return numeric_limits::max(); } static constexpr bool commute = true; }; #line 6 "main.cpp" void solve() { /* n グループ作る K-1 <= x_1 2K-1 <= x_2 ... x_1 <= n(K-1) */ /* x_1 >= K を固定 x_1 <= n(K-1) となる n をなるべく小さくとってよい、 x_2, ..., x_{n-1} x_1 より後ろなら ok x_n:nK-1 以降である必要がある 自由に n-1 個とる → すべて近場のときだけ例外 */ LL(N, K); VEC(int, A, N); if (K == 1) return print(A[0]); pq> que; ll que_sm = 0; FastSet ss(N); int ANS = A[K - 1]; vc B = A; FOR_R(i, N - 1) B[i] = min(B[i], B[i + 1]); FOR_R(i, K, N) { ll n = ceil(i, K - 1); while (len(que) >= n) { auto [x, i] = pick(que); que_sm -= x; ss.erase(i); } if (n * K <= N) { assert(len(que) == n - 1); // nK-1 以上のものがある? bool ok = ss.prev(N) >= n * K - 1; if (ok) { chmin(ANS, A[i] + que_sm); } else { ll x = que_sm - que.top().fi; x += B[n * K - 1]; chmin(ANS, A[i] + x); } } que.emplace(A[i], i); que_sm += A[i]; ss.insert(i); } print(ANS); } signed main() { cout << fixed << setprecision(15); ll T = 1; // LL(T); FOR(T) solve(); return 0; }