#include using namespace std; #define repu(i, begin, end) for (__typeof(begin) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) #define repe(i, begin, end) for (__typeof(begin) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) #define mem(a, x) memset(a, x, sizeof(a)) #define all(a) a.begin(), a.end() #define count_bits(x) __builtin_popcount(x) #define count_bitsll(x) __builtin_popcountll(x) #define least_bits(x) __builtin_ffs(x) #define least_bitsll(x) __builtin_ffsll(x) #define most_bits(x) 32 - __builtin_clz(x) #define most_bitsll(x) 64 - __builtin_clz(x) vector split(const string &s, char c) { vector v; stringstream ss(s); string x; while (getline(ss, x, c)) v.push_back(x); return v; } #define error(args...) { vector _v = split(#args, ','); err(_v.begin(), args); } void err(vector::iterator it) {} template void err(vector::iterator it, T a, Args... args) { cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n'; err(++it, args...); } typedef long long ll; const int MOD = 1000000007; template inline T tmin(T a, T b) {return (a < b) ? a : b;} template inline T tmax(T a, T b) {return (a > b) ? a : b;} template inline void amax(T &a, T b) {if (b > a) a = b;} template inline void amin(T &a, T b) {if (b < a) a = b;} template inline T tabs(T a) {return (a > 0) ? a : -a;} template T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;} const int N = 15; int n; ll B, C[N]; inline ll get(int l, int r) { ll ret = 0; repu(i, l, r + 1) ret += C[i]; return ret; } int main(int argc, char *argv[]) { ios_base::sync_with_stdio(false); cin >> B >> n; repu(i, 0, n) { cin >> C[i]; } sort(C, C + n); ll tot = get(0, n - 1); ll maxi = (tot + B) / n; ll ret = tot; amin(ret, tot - n * C[0]); amin(ret, n * C[n - 1] - tot); repu(i, 0, n - 1) { if (C[i] > maxi) break; if (i * 2 + 2 - n >= 0) amin(ret, (i * 2 + 2 - n) * C[i] + get(i + 1, n - 1) - get(0, i)); else amin(ret, (i * 2 + 2 - n) * tmax(maxi, C[i + 1]) + get(i + 1, n - 1) - get(0, i)); } printf("%lld\n", ret); return 0; }