Pagini recente » Cod sursa (job #168952) | Cod sursa (job #916426) | Cod sursa (job #2973208) | Cod sursa (job #2848805) | Cod sursa (job #462922)
Cod sursa(job #462922)
# include <cstdio>
typedef long long ll;
const char FIN[] = "inundatii.in", FOU[] = "inundatii.out";
const int MAX_N = 50005;
int N;
int X[MAX_N], Y[MAX_N], Z[MAX_N];
ll solve ( int XYZ[] )
{
ll aux = N >> 1, sol = 0;
for (int i = 0; i < N; ++i)
sol += (ll) i <= aux ? XYZ[i] - XYZ[aux] + aux - i : XYZ[aux] - XYZ[i] + i - aux ;
return sol;
}
int main()
{
freopen ( FIN, "r", stdin ) ;
freopen ( FOU, "w", stdout ) ;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d %d %d", &X[i], &Y[i], &Z[i]);
printf("%lld\n", ( ll ) solve ( X ) + solve ( Y ) + solve ( Z ) );
return 0;
}