Pagini recente » Cod sursa (job #2540040) | Cod sursa (job #29912) | Cod sursa (job #1831176) | Cod sursa (job #43940) | Cod sursa (job #1802714)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 50005;
int n;
int c[3][NMAX];
int64_t Solve(int i) {
sort(c[i] + 1, c[i] + n + 1);
int m = n / 2;
int64_t s = 1ll * m * m - (n & 1) * m;
for (int j = 1; j <= n; j++)
s += abs(c[i][j] - c[i][m]);
return s;
}
int main() {
ifstream f("inundatii.in");
ofstream g("inundatii.out");
f >> n;
for (int i = 1; i <= n; i++)
f >> c[0][i] >> c[1][i] >> c[2][i];
int64_t s = 0;
for (int i = 0; i < 3; i++)
s += Solve(i);
g << s << "\n";
return 0;
}