#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } ll op(ll a, ll b){ return a + b; } ll e(){ return 0LL; } int main(){ ll N, K, D; cin >> N >> K >> D; vector H(N); for (ll i = 0; i < N; i++){ cin >> H[i]; } map mp; vector rev; for (ll i = 0; i < N; i++){ mp[H[i]]++; } ll now = 0; for (auto it = mp.begin(); it != mp.end(); it++){ it->second = now; now++; rev.push_back(it->first); } segtree seg1(now); segtree seg2(now); for (ll i = 0; i < K; i++){ seg1.set(mp[H[i]], seg1.get(mp[H[i]]) + 1); seg2.set(mp[H[i]], seg2.get(mp[H[i]]) + H[i]); } ll INF = 100000000000000023; ll ans = INF; for (ll i = K - 1; i < N; i++){ if (i > K - 1){ seg1.set(mp[H[i - K]], seg1.get(mp[H[i - K]]) - 1); seg2.set(mp[H[i - K]], seg2.get(mp[H[i - K]]) - H[i - K]); seg1.set(mp[H[i]], seg1.get(mp[H[i]]) + 1); seg2.set(mp[H[i]], seg2.get(mp[H[i]]) + H[i]); } // どこに合わせるべきかを調整 ll left = rev[0] - D - 1; ll right = rev.back() + 1; while (right - left > 1){ ll mid = (left + right) / 2; ll l_bord = lower_bound(all(rev), mid) - rev.begin(); ll r_bord = lower_bound(all(rev), mid + D + 1) - rev.begin(); ll l_seg = 0, r_seg = 0; if (l_bord > 0){ l_seg = seg1.prod(0, l_bord); } if (r_bord < now){ r_seg = seg1.prod(r_bord, now); } if (l_seg <= r_seg){ left = mid; } else{ right = mid; } } ll l_bord = lower_bound(all(rev), left) - rev.begin(); ll r_bord = lower_bound(all(rev), left + D + 1) - rev.begin(); ll anssub = 0; ll l_seg = 0, r_seg = 0; if (l_bord > 0){ l_seg = seg1.prod(0, l_bord); debug(l_seg); anssub += (l_seg * left - seg2.prod(0, l_bord)); } if (r_bord < now){ r_seg = seg1.prod(r_bord, now); debug(r_seg); anssub += (seg2.prod(r_bord, now) - r_seg * (left + D)); } ans = min(ans, anssub); l_bord = lower_bound(all(rev), right) - rev.begin(); r_bord = lower_bound(all(rev), right + D + 1) - rev.begin(); anssub = 0; l_seg = 0; r_seg = 0; if (l_bord > 0){ l_seg = seg1.prod(0, l_bord); // debug(l_seg); anssub += (l_seg * right - seg2.prod(0, l_bord)); } if (r_bord < now){ r_seg = seg1.prod(r_bord, now); // debug(r_seg); anssub += (seg2.prod(r_bord, now) - r_seg * (right + D)); } ans = min(ans, anssub); } cout << ans << endl; }