#include using namespace std; #ifdef _DEBUG #define _GLIBCXX_DEBUG #include "dump.hpp" #else #define dump(...) #endif #define int long long typedef __int128_t Int; #define DBG 1 #define rep(i, a, b) for (int i = (a); i < (b); i++) #define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--) #define loop(n) rep(loop, (0), (n)) #define all(c) begin(c), end(c) const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const int MOD = (int)(1e9) + 7; const double PI = acos(-1); const double EPS = 1e-9; #define fi first #define se second #define eb emplace_back using pii = pair; // template ostream &operator<<(ostream &os,T &t){dump(t);return os;} template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template void printvv(const vector> &v) { cerr << endl; rep(i, 0, v.size()) rep(j, 0, v[i].size()) { if (typeid(v[i][j]) == typeid(INF) and v[i][j] == INF) { cerr << "INF"; } else cerr << v[i][j]; cerr << (j == v[i].size() - 1 ? '\n' : ' '); } cerr << endl; } std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } __int128 parse(string &s) { __int128 ret = 0; for (int i = 0; i < s.length(); i++) if ('0' <= s[i] && s[i] <= '9') ret = 10 * ret + s[i] - '0'; return ret; } #ifndef _DEBUG #define printvv(...) #endif void YES(bool f) { cout << (f ? "YES" : "NO") << endl; } void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } signed main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); int N, K; cin >> N >> K; vector A(N); rep(i, 0, N) { cin >> A[i]; } auto f = [&](int k) { vector v; int sum = 0; rep(i, 0, K) { sum += abs(A[i] - k); } v.eb(sum); rep(i, K, N) { sum += abs(A[i] - k); sum -= abs(A[i - K] - k); v.eb(sum); } return *min_element(all(v)); }; int l = 0, r = *max_element(all(A)) + 1; while (r - l > 1) { int m = (l + r) / 2; int x = f(m - 1), y = f(m), z = f(m + 1); dump(l, r); dump(m, x, y, z); if (x < y or y < z) r = m; else if (x > y or y > z) l = m; else raise(SIGABRT); } dump(l, f(l), r, f(r)); cout << min(f(l), f(r)) << endl; #ifdef _DEBUG int M = *max_element(all(A)) + 10; rep(i, 0, M) { dump(i, f(i)); } #endif return 0; }