import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken().to!int; } long readLong() { return readToken().to!long; } real readReal() { return readToken().to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } int N, K; long[] P, B; void main() { try { for (; ; ) { N = readInt(); K = readInt(); P = new long[N]; foreach (i; 0 .. N) { P[i] = readLong(); } B = new long[N]; foreach (i; 0 .. N) { B[i] = readLong(); } auto sum = new long[N + 1]; foreach (i; 0 .. N) { sum[i + 1] = sum[i] + abs(P[i] - B[i]); } long ans = 0; foreach (k; 0 .. K) { ans += sum[N]; int head = 0; foreach_reverse (i; 0 .. N - 1) { if (P[i] < P[i + 1]) { foreach_reverse (j; i + 1 .. N) { if (P[i] < P[j]) { head = i; P[i .. $] = P[j] ~ P[j + 1 .. N].reverse ~ P[i] ~ P[i + 1 .. j].reverse; goto found; } } } } P.reverse; found: foreach (i; head .. N) { sum[i + 1] = sum[i] + abs(P[i] - B[i]); } } writeln(ans); } } catch (EOFException e) { } }