#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <numeric>
#include <queue>
using namespace std;
#define mod (long)(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
//#define long long long
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };

int main(){
    long N, K;
    cin >> N >> K;
    vector<long> ds[N];
    for(int i = 0; i < N; i++){
        int t, d;
        cin >> t >> d;
        ds[t - 1].push_back(d);
    }
    vector<long> fronts;
    for(int i = 0; i < N; i++){
        if(!ds[i].empty()){
            sort(all(ds[i]));
            fronts.push_back(ds[i].back());
            ds[i].pop_back();
            reverse(all(ds[i]));
        }
    }
    sort(all(fronts), greater<>());
    long kind = min(long(fronts.size()), K);
    long now = accumulate(fronts.begin(), fronts.begin() + kind, 0l), ans;
    priority_queue<long> sushi;
    for(int i = 0; i < N; i++){
        for(long j: ds[i]){
            sushi.push(j);
        }
    }
    for(int i = 0; i < K - kind; i++){
        now += sushi.top();
        sushi.pop();
    }
    ans = now + kind * kind;
    for(long i = kind - 1; i >= 1; i--){
        sushi.push(fronts[i]);
        now += sushi.top() - fronts[i];
        sushi.pop();
        ans = max(ans, now + i * i);
    }
    cout << ans << endl;
}


Measured memory_bytes: 6904