#include "aliens.h"
#include <iostream>
#include <algorithm>
#include <utility>
#include <climits>
#include <set>
using namespace std;
long long sq(long long a) {
return a * a;
}
long long sq(int a) {
return (long long)(a) * a;
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
set<pair<int, int>> curPoints;
for (int i = 0; i < n; ++i) curPoints.emplace(min(r[i], c[i]), max(r[i], c[i]));
long long leastCost = LLONG_MAX / 2;
while (curPoints.size() > k) {
leastCost = LLONG_MAX / 2;
auto curStart = curPoints.end(), curEnd = curPoints.end();
for (auto i = curPoints.begin(); i != curPoints.end(); ++i) {
for (auto j = next(i); j != curPoints.end(); ++j) {
auto a = *i, b = *j;
pair<int, int> newRange = make_pair(min(a.first, b.first), max(a.second, b.second)), overlap = make_pair(max(a.first, b.first), min(a.second, b.second));
long long curCost = sq(newRange.second - newRange.first + 1) - sq(a.second - a.first + 1) - sq(b.second - b.first + 1) + sq(max(0, overlap.second - overlap.first + 1));
if (curCost < leastCost) {
leastCost = curCost;
curStart = i;
curEnd = j;
}
}
}
auto a = *curStart, b = *curEnd;
pair<int, int> newRange = make_pair(min(a.first, b.first), max(a.second, b.second));
curPoints.erase(curStart);
curPoints.erase(curEnd);
curPoints.insert(newRange);
}
vector<pair<int, int>> condensedPoints;
int curBegin = -1, curEnd = -1;
for (auto i = curPoints.begin(); i != curPoints.end(); ++i) {
auto a = *i;
if (a.first == curBegin) curEnd = max(curEnd, a.second);
else {
if (curBegin != -1) condensedPoints.emplace_back(curBegin, curEnd);
curBegin = a.first;
curEnd = a.second;
}
}
condensedPoints.emplace_back(curBegin, curEnd);
long long res = 0;
for (int i = 0; i < condensedPoints.size() - 1; ++i) {
auto a = condensedPoints[i], b = condensedPoints[i + 1];
// cout << i << ' ' << a.first << ' ' << a.second << " " << b.first << ' ' << b.second << " " << res << ' ';
res += sq(a.second - a.first + 1);
res -= sq(max(0, min(a.second, b.second) - max(a.first, b.first) + 1));
// cout << res << '\n';
}
res += sq(condensedPoints.back().second - condensedPoints.back().first + 1);
return res;
}
