#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const ll INF = 1e18 + 69;
ll sqr(ll x){return x * x;}
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
vector<pair<int, int>> point;
for(int i = 0; i<n; ++i) {
r[i]++; c[i]++;
if (r[i] > c[i]) swap(r[i], c[i]);
point.push_back({r[i], c[i]});
}
point.push_back({0, 0});
sort(ALL(point), [](pair<int, int> x, pair<int, int> y){return x.second < y.second;});
vector<ll> dp(n+1, INF);
dp[0] = 0;
ll ans = INF;
while(k--){
int L = m + 1;
for(int i = n; i>=1; --i) {
int l = point[i].first;
ll lmao = 0;
if (L <= point[i].second) lmao = sqr(point[i].second - L + 1);
for(int j = i; j>=1; --j){
minimize(l, point[j].first);
if (point[j].second != point[j-1].second && l < L){
ll cost = sqr(point[i].second - l + 1) - lmao;
minimize(dp[i], dp[j-1] + cost);
}
}
minimize(L, point[i].first);
}
minimize(ans, dp.back());
}
return ans;
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// clock_t start = clock();
// int n, m, k; cin >> n >> m >> k;
// vector<int> r(m), c(m);
// for(int i = 0; i<n; ++i) cin >> r[i] >> c[i];
// cout << take_photos(n, m, k, r, c) << "\n";
// cerr << "Time elapsed: " << clock() - start << " ms\n";
// return 0;
// }
