import java.util.TreeSet; public class Main { private static void solve() { int n = ni(); int k = ni(); int[] a = na(n); long sumH = 0; long sumL = 0; TreeSet setH = new TreeSet<>((o1, o2) -> o1[0] == o2[0] ? o1[1] - o2[1] : o1[0] - o2[0]); TreeSet setL = new TreeSet<>((o1, o2) -> o1[0] == o2[0] ? o1[1] - o2[1] : o1[0] - o2[0]); for (int i = 0; i < k; i ++) { sumH += a[i]; setH.add(new int[] {a[i], i}); } for (int i = 0; i < k / 2; i ++) { int[] v = setH.pollFirst(); setL.add(v); sumH -= v[0]; sumL += v[0]; } long mid = setH.first()[0]; long ret = Math.abs(sumH - mid * setH.size()) + Math.abs(sumL - mid * setL.size()); for (int i = k; i < n; i ++) { int[] first = new int[] {a[i - k], i - k}; int[] u = new int[] {a[i], i}; if (setL.last()[0] <= a[i]) { setH.add(u); sumH += a[i]; } else { setL.add(u); sumL += a[i]; } if (setH.contains(first)) { setH.remove(first); sumH -= first[0]; } else { setL.remove(first); sumL -= first[0]; } while (setH.size()> setL.size() + 1) { int[] v = setH.pollFirst(); setL.add(v); sumH -= v[0]; sumL += v[0]; } while (setL.size()> setH.size()) { int[] v = setL.pollLast(); setH.add(v); sumL -= v[0]; sumH += v[0]; } mid = setH.first()[0]; if (sumH < mid * setH.size()) { System.out.println("Error1"); } if (sumL > mid * setL.size()) { System.out.println("Error2"); } long now = Math.abs(sumH - mid * setH.size()) + Math.abs(sumL - mid * setL.size()); ret = Math.min(now, ret); } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }