#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class T, class Cost> struct MonotoneMinDP {
  int n;
  Cost cost;
  vector<T> ts;
  vector<int> par;
  MonotoneMinDP() {}
  MonotoneMinDP(int n_, Cost cost_) : n(n_), cost(cost_) {
    ts.assign(n + 1, T());
    par.assign(n + 1, -1);
    // from que[k].first to [que[k].second, que[k + 1].second)
    vector<pair<int, int>> que(n + 1);
    int head = 0, tail = 1;
    que[0] = make_pair(0, 1);
    for (int i = 1; i <= n; ++i) {
      for (; head + 1 < tail && que[head + 1].second <= i; ++head) {}
      par[i] = que[head].first;
      ts[i] = ts[par[i]] + cost(par[i], i);
      int j = -1;
      for (; head < tail && que[tail - 1].second >= (j = when(que[tail - 1].first, i)); --tail) {}
      if (head == tail) j = i + 1;
      que[tail++] = make_pair(i, j);
    }
  }
  int when(int i0, int i1) const {
    int lo = i1, hi = n + 1;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      ((ts[i0] + cost(i0, mid) < ts[i1] + cost(i1, mid)) ? lo : hi) = mid;
    }
    return hi;
  }
};
template <class T, class Cost> MonotoneMinDP<T, Cost> monotoneMinDP(int n, Cost cost) {
  return MonotoneMinDP<T, Cost>(n, cost);
}


template <class D, class F> auto goldenMax(D a, D b, int numIters, F f) {
  constexpr D GOLD = (3.0L - sqrt(5.0L)) / 2.0L;
  D c = a + GOLD * (b - a), d = b - GOLD * (b - a);
  auto fc = f(c), fd = f(d);
  for (int iter = 0; iter < numIters; ++iter) {
    if (fc < fd) { a = c; c = d; d = b - GOLD * (b - a); fc = fd; fd = f(d); }
    else         { b = d; d = c; c = a + GOLD * (b - a); fd = fc; fc = f(c); }
  }
  return make_pair(fc, c);
}


using Double = long double;

int N, M;
vector<Int> S;

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    S.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &S[i]);
    }
    sort(S.begin(), S.end());
    
    vector<Int> SSum(N + 1, 0);
    for (int i = 0; i < N; ++i) {
      SSum[i + 1] = SSum[i] + S[i];
    }
    
    auto cost = [&](int l, int r) -> Double {
      return sqrt((Double)((r - l) * (SSum[r] - SSum[l])));
    };
    auto lag = [&](const Double pena) {
      return monotoneMinDP<Double>(N, [&](int l, int r) -> Double {
        return cost(l, r) + pena;
      });
    };
    // cost <= sqrt(N SSum[N]) <= (2*10^5) * sqrt(10^5)
    const auto res = goldenMax(-2e8L, +2e8L, 200, [&](const Double pena) -> Double {
      const auto m = lag(pena);
// cerr<<pena<<": "<<m.ts<<" "<<m.par<<" "<<(m.ts[N]-M*pena)<<endl;
      return m.ts[N] - M * pena;
    });
    
    printf("%.20Lf\n", res.first);
  }
  return 0;
}