Pagini recente » Cod sursa (job #636370) | Cod sursa (job #2901583) | Cod sursa (job #1458138) | Cod sursa (job #2701737) | Cod sursa (job #2867199)
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
ifstream in("inundatii.in");
ofstream out("inundatii.out");
const int N = 5e4;
int n;
int a[N + 5], b[N + 5], c[N + 5];
ll ans;
ll solve(int v[]) {
ll dif = 0LL;
int med = n / 2;
for (int i = 1; i <= n; i++)
dif += 1LL * abs(v[i] - (v[med] - (med - i)));
return dif;
}
int main() {
in >> n;
for (int i = 1; i <= n; i++)
in >> a[i] >> b[i] >> c[i];
ans += solve(a);
ans += solve(b);
ans += solve(c);
out << ans << '\n';
return 0;
}