Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ll> sl;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second

ll n, k;
ll t[100050];
ll d[100050];

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	//freopen("in.txt", "r", stdin);
	cin >> n >> k;
	// pair<score, type> 
	vector<pair<ll, ll>> food;
	rep(i,0,n) {
		ll t, d;
		cin >> t >> d;
		food.pb(mp(d, t));
	}
	sort(food.rbegin(), food.rend());

	set<ll> have;
	priority_queue<ll> Q;
	ll locret = 0;
	ll ret = 0;
	rep(i,0,k) {
		ll d = food[i].F;
		ll t = food[i].S;

		if(have.count(t)) {
			Q.push(-d);
		} else {
			have.insert(t);
		}

		locret += d;
	}
	ret = locret + have.size() * have.size();

	rep(i,k,n) {
		ll d = food[i].F;
		ll t = food[i].S;

		if(Q.empty()) break;
		ll minD = -Q.top();
		Q.pop();

		if(have.count(t)) {
			Q.push(-d);
		} else {
			have.insert(t);
		}

		locret = locret + d - minD;
		ret = max(ret, locret + have.size() * have.size());
	}

	cout << ret << '\n';
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:68:26: error: no matching function for call to 'max(ll&, long long unsigned int)'
   68 |                 ret = max(ret, locret + have.size() * have.size());
      |                       ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:68:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'long long unsigned int')
   68 |                 ret = max(ret, locret + have.size() * have.size());
      |                       ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:68:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   68 |                 ret = max(ret, locret + have.size() * have.size());
      |                       ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~