Language: C

#if 0
cat <<EOF >mistaken-paste
#endif
// thanks for @rsk0315_h4x

#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
#define _USE_MATH_DEFINES

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <time.h>

#define BIG 2000000007
#define VERYBIG 2000000000000007LL

#define MOD 1000000007
#define FOD  998244353
typedef uint64_t ull;
typedef  int64_t sll;

#define N_MAX 1000000

#ifdef __cplusplus
#include <queue>
#include <stack>
#include <tuple>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <functional>
#include <array>

using std::queue;
using std::priority_queue;
using std::stack;
using std::tuple;
using std::set;
using std::map;
using std::vector;
using std::greater;
using std::pair;
using std::string;
using std::get;

template <typename T, typename U>
pair<T, U> operator+(pair<T, U> l, pair<T, U> r) {
	return pair<T, U>(l.first + r.first, l.second + r.second);
}

#endif

typedef struct {
	int32_t a;
	int32_t b;
} hw;

typedef struct {
	sll a;
	sll b;
} hwll;

typedef struct {
	sll a;
	sll b;
	sll c;
} hwllc;

typedef struct {
	hwll a;
	hwll b;
} linell;

ull n, m;
ull h, w;
ull k;
ull q;
sll va, vb, vc, vd, ve, vf;
ull ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;

ull umin (ull x, ull y) {
	return (x < y) ? x : y;
}

ull umax (ull x, ull y) {
	return (x > y) ? x : y;
}

sll smin (sll x, sll y) {
	return (x < y) ? x : y;
}

sll smax (sll x, sll y) {
	return (x > y) ? x : y;
}

ull gcd (ull x, ull y) {
	if (x < y) {
		return gcd(y, x);
	} else if (y == 0) {
		return x;
	} else {
		return gcd(y, x % y);
	}
}

ull bitpow (ull a, ull x, ull modulo) {
	ull result = 1;
	while (x) {
		if (x & 1) {
			result *= a;
			result %= modulo;
		}
		x /= 2;
		a = (a * a) % modulo;
	}
	return result;
}

ull divide (ull a, ull b, ull modulo) {
	return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}

ull udiff (ull a, ull b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

sll sdiff (sll a, sll b) {
	if (a >= b) {
		return a - b;
	} else {
		return b - a;
	}
}

int bitcount (ull n) {
	int result = 0;
	while (n) {
		if (n & 1) result++;
		n /= 2;
	}
	return result;
}

#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)
#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right
#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1

// int32_t pullcomp (const void *left, const void *right) {
// 	ull l = *(ull*)left;
// 	ull r = *(ull*)right;
// 	if (l < r) {
// 		return -1;
// 	}
// 	if (l > r) {
// 		return +1;
// 	}
// 	return 0;
// }
BEGCMP(pullcomp){
	DEFLR(ull);
	CMPRET(l, r);
	return 0;
}
BEGCMP(prevcomp){
	DEFLR(ull);
	CMPRET(r, l);
	return 0;
}
BEGCMP(psllcomp){
	DEFLR(sll);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pcharcomp){
	DEFLR(char);
	CMPRET(l, r);
	return 0;
}
BEGCMP(pdoublecomp){
	DEFLR(double);
	CMPRET(l, r);
	return 0;
}

int32_t pstrcomp (const void *left, const void *right) {
	char* l = *(char**)left;
	char* r = *(char**)right;

	return strcmp(l, r);
}

BEGCMP(phwllABcomp){
	DEFLR(hwll);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	return 0;
}
BEGCMP(phwllREVcomp){
	DEFLR(hwll);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	return 0;
}
BEGCMP(ptriplecomp){
	DEFLR(hwllc);
	CMPRET(l.a, r.a);
	CMPRET(l.b, r.b);
	CMPRET(l.c, r.c);
	return 0;
}
BEGCMP(ptripleREVcomp){
	DEFLR(hwllc);
	CMPRET(l.b, r.b);
	CMPRET(l.a, r.a);
	CMPRET(l.c, r.c);
	return 0;
}

int32_t pquadcomp (const void *left, const void *right) {
	linell l = *(linell*)left;
	linell r = *(linell*)right;

	sll ac = phwllABcomp(&(l.a), &(r.a));
	if (ac) return ac;
	sll bc = phwllABcomp(&(l.b), &(r.b));
	if (bc) return bc;

	return 0;
}

bool isinrange (sll left, sll x, sll right) {
	return (left <= x && x <= right);
}

bool isinrange_soft (sll left, sll x, sll right) {
	return (left <= x && x <= right) || (left >= x && x >= right);
}

sll a[N_MAX + 5];
// ull a[N_MAX + 5];
// sll a[3001][3001];
sll b[N_MAX + 5];
// ull b[N_MAX + 5];
// sll b[3001][3001];
sll c[N_MAX + 5];
ull d[N_MAX + 5];
sll e[N_MAX];
char s[N_MAX + 1];
// char s[3010][3010];
char t[N_MAX + 1];
// char t[3010][3010];
char u[N_MAX + 1];
hwll xy[N_MAX + 5];
hwllc tup[N_MAX + 5];
sll table[3005][3005];
// here we go

ull gin[N_MAX];
hwll sorted[N_MAX];

ull solve () {
	sll i, j, ki, li;
	// ull result = 0;
	sll result = 0;
	double dresult = 0;
	// ull maybe = 0;
	sll maybe = 0;
	// ull sum = 0;
	sll sum = 0;
	sll item;
	ull *dpcell;

	for (i = 0; i < n; i++) {
		xy[i] = (hwll){a[i], -b[i]};
	}
	qsort(xy, n, sizeof(hwll), phwllABcomp);
	i = j = 0;
	while (i <= n) {
		gin[i] = j;
		while (j < n && xy[j].a == i) j++;
		i++;
	}

	for (i = 0; i < n; i++) {
		// printf("%lld %Lld\n", xy[i].a, xy[i].b);
	}

	ull l = 0;
	for (i = 0; i < n; i++) {
		if (gin[i] < gin[i + 1]) {
			sorted[l++] = (hwll){xy[gin[i]].b, xy[gin[i]].a};
		}
	}
	qsort(sorted, l, sizeof(hwll), phwllABcomp);

	for (i = 0; i < l; i++) {
		// printf("%lld %lld\n", sorted[i].a, sorted[i].b);
	}

	typedef pair<sll, sll> P;
	typedef pair<sll, P> T;
	priority_queue<T, vector<T> > que;
	ull first = umin(l, k);
	for (i = 0; i < first; i++) {
		ull kindv = sorted[i].b;
		c[kindv] = -sorted[i].a;
		d[kindv] = 1;
		result += c[kindv];

		// printf("adding %lld -> %lld\n", c[i], result);
		if (gin[kindv] + 1 < gin[kindv + 1]) que.push(T(-xy[gin[kindv] + 1].b, P(gin[kindv] + 1, kindv)));
	}
	sum = result;
	// printf("%lld first: %lld\n", result, first);
	i = first;
	ull cnt = first;
	while (i) {
		// printf("%llu.... %lld\n", cnt, sum);
		while (cnt < k && !que.empty()) {
			T p = que.top();
			que.pop();


			ull kindv = p.second.second;
			ull index = p.second.first;
			// printf("%lld (%lld %lld)\n", p.first, index, kindv);
			sum += p.first;
			c[kindv] += p.first;
			d[kindv]++;

			if (xy[index + 1].a == kindv) {
				que.push(T(-xy[index + 1].b, P(index + 1, kindv)));
			}

			cnt++;
		}

		result = smax(result, sum + i * i);
		// printf("%lld\n", sum);

		i--;
		ull reduce = sorted[i].b;
		sum -= c[reduce];
		cnt -= d[reduce];
		// printf("-%lld..\n", c[reduce]);
	}

	printf("%lld\n", result);
	// printf("%.15lf\n", dresult);
	// puts(s);

	return 0;

	success:
	// puts("YES");
	puts("Yes");
	// printf("%llu\n", result);
	// puts("0");
	// puts("Yay!");
	return 0;

	fail:
	// puts("NO");
	puts("No");
	// puts("0");
	// puts("-1");
	// puts("-1 -1 -1");
	// puts("Impossible");
	return 1;
}

int32_t main (void) {
	int32_t i, j;
	int32_t x, y;

	n = 3;

	// scanf("%llu%llu", &h, &w);
	scanf("%llu", &n, &m);
	scanf("%llu", &k, &n, &m);
	// scanf("%llu%llu", &h, &w);
	// scanf("%s", s);
	// scanf("%llu", &q);
	// scanf("%lld%lld", &va, &vb, &vc, &vd);
	// scanf("%llu%llu%llu", &ua, &ub, &uc, &ud, &ue);
	// scanf("%s", t);
	// scanf("%llu", &k);
	// scanf("%lld", &m);
	for (i = 0; i < n; i++) {
		// scanf("%lld%lld", &xy[i].a, &xy[i].b);
		// scanf("%lld%lld%lld", &tup[i].a, &tup[i].b, &tup[i].c);
		scanf("%lld", &a[i]);
		scanf("%lld", &b[i]);
		// scanf("%lld", &c[i]);
		// scanf("%lld", &d[i]);
		a[i]--;
		// b[i]--;
		// c[i]--;
		// d[i]--;
		// xy[i].a--;
		// xy[i].b--;
		// tup[i].a--;
		// tup[i].b--;
	}
	// for (i = 0; i < n - 1; i++) {
	// 	scanf("%lld%lld", &a[i], &b[i]);
	// 	a[i]--;
	// 	b[i]--;
	// }
	// for (i = 1; i <= n; i++) {
	// 	scanf("%llu", &d[i]);
	// }
	// for (i = 0; i < n; i++) {
	// 	scanf("%lld%lld%lld", &c[i], &a[i], &b[i]);
	// }

	// for (i = 0; i < q; i++) {
	// 	// scanf("%lld%lld", &xy[i].a, &xy[i].b);
	// 	scanf("%lld", &c[i]);
	// 	// xy[i].a--;
	// 	// xy[i].b--;
	// }

	// for (i = 0; i < n; i++) {
	// 	for (j = 0; j < n; j++) {
	// 		scanf("%lld", &table[i][j]);
	// 		// table[i][j]--;
	// 	}
	// }
	// for (i = 0; i < h; i++) {
	// 	scanf("%s", s[i]);
	// }
	// scanf("%llu", &q);

	solve();

	return 0;
}


Compiler output:
main.c: In function 'solve':
main.c:312:21: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
  312 |         typedef pair<sll, sll> P;
      |                     ^
main.c:312:21: error: expected expression before '<' token
main.c:313:21: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
  313 |         typedef pair<sll, P> T;
      |                     ^
main.c:313:21: error: expected expression before '<' token
main.c:314:9: error: 'priority_queue' undeclared (first use in this function)
  314 |         priority_queue<T, vector<T> > que;
      |         ^~~~~~~~~~~~~~
main.c:314:9: note: each undeclared identifier is reported only once for each function it appears in
main.c:314:24: error: 'T' undeclared (first use in this function)
  314 |         priority_queue<T, vector<T> > que;
      |                        ^
main.c:314:27: error: 'vector' undeclared (first use in this function)
  314 |         priority_queue<T, vector<T> > que;
      |                           ^~~~~~
main.c:314:37: error: expected expression before '>' token
  314 |         priority_queue<T, vector<T> > que;
      |                                     ^
main.c:323:54: error: 'que' undeclared (first use in this function); did you mean 'ue'?
  323 |                 if (gin[kindv] + 1 < gin[kindv + 1]) que.push(T(-xy[gin[kindv] + 1].b, P(gin[kindv] + 1, kindv)));
      |                                                      ^~~
      |                                                      ue
main.c:323:63: error: implicit declaration of function 'T' [-Wimplicit-function-declaration]
  323 |                 if (gin[kindv] + 1 < gin[kindv + 1]) que.push(T(-xy[gin[kindv] + 1].b, P(gin[kindv] + 1, kindv)));
      |                                                               ^
main.c:323:88: error: implicit declaration of function 'P' [-Wimplicit-function-declaration]
  323 |                 if (gin[kindv] + 1 < gin[kindv + 1]) que.push(T(-xy[gin[kindv] + 1].b, P(gin[kindv] + 1, kindv)));
      |                                                                                        ^
main.c:332:26: error: expected ';' before 'p'
  332 |                         T p = que.top();
      |                          ^~
      |                          ;
main.c:336:37: error: 'p' undeclared (first use in this function)
  336 |                         ull kindv = p.second.second;
      |                                     ^