#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

void solve() {
  int n;
  i64 m;
  cin >> n >> m;
  vi32 a(n);
  cin >> a;
  sort(all(a));
  reverse(all(a));

  i64 ok = 0, ng = 1e18;
  while (ng - ok > 1) {
    i64 md = (ok + ng) / 2;
    i64 cnt = 0;
    rep(i, n) {
      i64 x = md - a[i];
      {
        int ok = -1, ng = n;
        while (abs(ok - ng) > 1) {
          int md = (ok + ng) / 2;
          (a[md] >= x ? ok : ng) = md;
        }
        cnt += ok + 1;
      }
    }
    (cnt >= m ? ok : ng) = md;
  }

  vi64 sums(n + 1);
  rep(i, n) sums[i + 1] += sums[i] + a[i];

  i64 ans = 0;
  i64 min_value = ok;
  i64 over_cnt = 0;
  rep(i, n) {
    int ok = -1, ng = n;
    while (abs(ok - ng) > 1) {
      int md = (ok + ng) / 2;
      (a[md] + a[i] > min_value ? ok : ng) = md;
    }
    i64 match = ok + 1;
    over_cnt += match;
    ans += (i64) a[i] * (ok + 1) + sums[ok + 1];
  }
  ans += (m - over_cnt) * min_value;
  cout << ans << endl;
}


Measured memory_bytes: 1408