Problem:
Score : 400 points

Problem Statement

There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i.
You are choosing K among these N pieces to eat.
Your "satisfaction" here will be calculated as follows:

The satisfaction is the sum of the "base total deliciousness" and the "variety bonus".

The base total deliciousness is the sum of the deliciousness of the pieces you eat.

The variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.

You want to have as much satisfaction as possible.
Find this maximum satisfaction.

Constraints

1 \leq K \leq N \leq 10^5

1 \leq t_i \leq N

1 \leq d_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
t_1 d_1
t_2 d_2
.
.
.
t_N d_N

Output

Print the maximum satisfaction that you can obtain.

Sample Input 1

5 3
1 9
1 7
2 6
2 5
3 1

Sample Output 1

26

If you eat Sushi 1,2 and 3:

The base total deliciousness is 9+7+6=22.

The variety bonus is 2*2=4.

Thus, your satisfaction will be 26, which is optimal.

Sample Input 2

7 4
1 1
2 1
3 1
4 6
4 5
4 5
4 5

Sample Output 2

25

It is optimal to eat Sushi 1,2,3 and 4.

Sample Input 3

6 5
5 1000000000
2 990000000
3 980000000
6 970000000
6 960000000
4 950000000

Sample Output 3

4900000016

Note that the output may not fit into a 32-bit integer type.

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        checked
        {
            var x1 = (int)1e5;
            var x2 = (int)1e5;
            var l = (long)x1 * x2;
            Console.WriteLine(l);
        }
        var N = sc.ReadInt();
        var K = sc.ReadInt();
        var tds = new Tuple<long, long>[N];
        for (int i = 0; i < N; i++)
        {
            var t = Tuple.Create(sc.ReadLong(), sc.ReadLong());
            tds[i] = t;
        }
        tds = tds.OrderByDescending(x => x.Item2).ToArray();

        int tCount = 0;
        var types = new HashMap<long, long>();
        var xxx = new List<Tuple<long, long>>();
        for (int i = 0; i < K; i++)
        {
            types[tds[i].Item1]++;
            if (types[tds[i].Item1] > 1)
            {
                xxx.Add(tds[i]);
            }
            else
            {
                checked
                {
                    tCount++;
                }
            }
        }
        // 重複している者のうち小さいものから順に並べたデータ
        xxx = xxx.OrderBy(x => x.Item2).ToList();

        long sum = tds.Take(K).Sum(x => x.Item2);
        long bonus = tCount * tCount;
        long ans = sum + bonus;

        // 順番に種類を増やしてく
        foreach (var td in tds.Skip(K))
        {
            var newType = td.Item1;
            if (types[newType] == 0 && xxx.Count > 0)
            {
                types[newType]++;
                var ri = xxx[0];
                xxx.RemoveAt(0);
                sum -= (ri.Item2 - td.Item2);
                tCount++;
                bonus = ((long)tCount) * ((long)tCount);
                ans = Math.Max(ans, sum + bonus);
            }
        }

        Console.WriteLine(ans);
    }
    static Scanner sc = new Scanner();
}

class HashMap<K, V> : Dictionary<K, V> where V : new()
{
    private V DefaltValue = new V();
    public HashMap() { }
    public HashMap(V defaultValue)
    {
        this.DefaltValue = new V();
    }
    new public V this[K i]
    {
        get
        {
            V v;
            return TryGetValue(i, out v) ? v : base[i] = this.DefaltValue;
        }
        set { base[i] = value; }
    }
}

class Scanner
{
    string[] S = new string[0];
    int Index = 0;
    char[] Separators = new char[] { ' ' };

    public string Next()
    {
        if (this.Index < this.S.Length) return this.S[this.Index++];
        var line = "";
        while (line == "") line = Console.ReadLine();
        this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);
        if (this.S.Length == 0) return this.Next();
        this.Index = 0;
        return this.S[this.Index++];
    }
    public string ReadStr()
    {
        return this.Next();
    }
    public char ReadChar()
    {
        return this.Next()[0];
    }
    public int ReadInt()
    {
        return int.Parse(this.Next());
    }
    public uint ReadUInt()
    {
        return uint.Parse(this.Next());
    }
    public long ReadLong()
    {
        return long.Parse(this.Next());
    }
    public double ReadDouble()
    {
        return double.Parse(this.Next());
    }
    public Tuple<int, int> ReadTup()
    {
        return Tuple.Create(this.ReadInt(), this.ReadInt());
    }
    public Tuple<int, int, int> ReadTup3()
    {
        return Tuple.Create(this.ReadInt(), this.ReadInt(), this.ReadInt());
    }
    public Tuple<int, int, int, int> ReadTup4()
    {
        return Tuple.Create(this.ReadInt(), this.ReadInt(), this.ReadInt(), this.ReadInt());
    }
    public int[] ReadIntArray(int n)
    {
        var array = new int[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadInt();
        }
        return array;
    }
    public long[] ReadLongArray(int n)
    {
        var array = new long[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadLong();
        }
        return array;
    }
    public double[] ReadDoubleArray(int n)
    {
        var array = new double[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadDouble();
        }
        return array;
    }
    public char[] ReadCharArray(int n)
    {
        var array = new char[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadChar();
        }
        return array;
    }
    public string[] ReadStrArray(int n)
    {
        var array = new string[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadStr();
        }
        return array;
    }
    public Tuple<int, int>[] ReadTupArray(int n)
    {
        var array = new Tuple<int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup();
        }
        return array;
    }
    public Tuple<int, int, int>[] ReadTup3Array(int n)
    {
        var array = new Tuple<int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup3();
        }
        return array;
    }
    public Tuple<int, int, int, int>[] ReadTup4Array(int n)
    {
        var array = new Tuple<int, int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup4();
        }
        return array;
    }
}