using System;
using System.Collections;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    struct Data {
        public int Index;
        public int Sum;
        public bool Same;
    }

    public void Run() {
        var n = ni();
        var m = nl();
        var a = ni(n);

        Array.Sort(a);

        var sum = a.Select(x => (long)x).ToArray();
        for (int i = n - 2; i >= 0; i--) {
            sum[i] += sum[i + 1];
        }

        int lower = 0, upper = 100000 * 3;
        long ans = sum[0] * n * 2;
        while (lower <= upper) {
            var mid = (lower + upper) >> 1;

            long handShake = 0;
            long total = 0;

            for (int i = 0; i < n; i++) {
                var b = LowerBound(a, mid - a[i]);
                handShake += n - b;
                if (b < n) {
                    total += sum[b] + 1L * (n - b) * a[i];
                }
            }
            if (handShake <= m) {
                // ans
                upper = mid - 1;
            } else {
                ans = total - mid * (handShake - m);
                lower = mid + 1;
            }
        }
        cout.WriteLine(ans);
    }
    public static int LowerBound<T>(IList<T> A, T x) { return LowerBound(A, 0, A.Count, x); }
    public static int LowerBound<T>(IList<T> A, T x, IComparer<T> comparer) { return LowerBound(A, 0, A.Count, x, comparer); }
    public static int LowerBound<T>(IList<T> A, T x, Comparison<T> comp) { return LowerBound(A, 0, A.Count, x, Comparer<T>.Create(comp)); }
    public static int LowerBound<T>(IList<T> A, int start, int end, T x) { return LowerBound(A, start, end, x, Comparer<T>.Default); }
    public static int LowerBound<T>(IList<T> A, int start, int end, T x, Comparison<T> comp) { return LowerBound(A, start, end, x, Comparer<T>.Create(comp)); }
    public static int LowerBound<T>(IList<T> A, int start, int end, T x, IComparer<T> comparer) {
        int lower = start, upper = end - 1;
        int result = end;
        while (lower <= upper) {
            int pos = (lower + upper) >> 1;
            if (comparer.Compare(x, A[pos]) <= 0) {
                result = pos;
                upper = pos - 1;
            } else {
                lower = pos + 1;
            }
        }
        return result;
    }

}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 25824