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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7  
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;

bool f(int a, int b) {
    return a > b;
}

int main() {
    int n, k;
    cin >> n >> k;
    vector<vector<int>>x(n);
    rep(i, n) {
        int t, d;
        cin >> t >> d;
        t--;
        x[t].push_back(d);
    }
    rep(i, n) {
        sort(x[i].begin(), x[i].end(), f);
    }
    priority_queue<int>pq, cq;
    rep(i, n) {
        if (x[i].size() == 0)continue;
        pq.push(x[i][0]);
    }
    rep(i, n) {
        if (x[i].size()== 0)continue;
        arep(j, 1, (int)x[i].size()) {
            cq.push(x[i][j]);
        }
    }
    priority_queue<int, vector<int>, greater<int>>q;
    ll sum = 0, dd = 0;
    rep(i, k) {
        if (pq.size()) {
            sum += pq.top();
            q.push(pq.top());
            pq.pop();
            dd++;
        }
        else {
            sum += cq.top(); pq.pop();
        }
    }
    ll ans = sum + dd * dd;
    dd--;
    while (dd > 0) {
        sum -= q.top(); 
        cq.push(q.top());
        q.pop();
        sum += cq.top(); cq.pop();

        ans = max(ans, sum + dd * dd);
        dd--;
    }
    cout << ans << endl;


    return 0;
}