Language: C++

#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 29;
const ll INF64 = 1ll << 40;
const int mod = 1000000007;
//const int mod = 998244353;

template <class T>inline bool chmin(T &a, const T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline bool chmax(T &a, const T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if(i < n-1) cout << " ";
  }
  cout << endl;
  return;
}

struct mint
{
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint &operator++()
  {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--()
  {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const
  {
    return pow(mod - 2);
  }
  mint &operator/=(const mint a)
  {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const
  {
    mint res(*this);
    return res /= a;
  }
};



int main()
{
  ll n, k;
  cin >> n >> k;
  vector<vector<ll>> sushi(n);
  rep(i, n) {
    int t;
    ll d;
    cin >> t >> d;
    --t;
    sushi[t].push_back(d);
  }
  rep(i, n) if(sushi[i].size() == 0) sushi[i].push_back(-INF64);
  for(auto &v : sushi) {
    sort(rALL(v));
    if(v.empty()) v.push_back(-INF64)
  }
  auto comp = [&](vector<ll> a, vector<ll> b) {
    return a[0] > b[0];
  };
  sort(sushi.begin(), sushi.end(), comp);
  priority_queue<ll> pq;
  ll cur = 0;
  rep(i, k) {
    cur += sushi[i][0];
    for(int j = 1; j < sushi[i].size(); ++j) pq.push(sushi[i][j]);
  }
  for(int i = k; i < n; ++i) for(int j = 0; j < sushi[i].size(); ++j) pq.push(sushi[i][j]);

  ll res = cur + k*k;
  for(ll x = k-1; x >= 1; --x) {
    ll v = sushi[x][0];
    ll w = pq.top();
    if(v < w) {
      pq.pop(); cur += w;
      pq.push(v); cur -= v;
    }
    chmax(res, cur+x*x);
  }
  cout << res << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:140:38: error: expected ';' before '}' token
  140 |     if(v.empty()) v.push_back(-INF64)
      |                                      ^
      |                                      ;
  141 |   }
      |   ~