Pagini recente » Cod sursa (job #1479748) | Cod sursa (job #2649043) | Cod sursa (job #873879) | Cod sursa (job #1418062) | Cod sursa (job #2969336)
#include <fstream>
using namespace std;
ifstream in ("inundatii.in");
ofstream out ("inundatii.out");
const int max_size = 5e4 + 1;
int x[max_size], y[max_size], z[max_size];
int main ()
{
int n;
in >> n;
for (int i = 1; i <= n; i++)
{
in >> x[i] >> y[i] >> z[i];
}
int ans = 0, m = n / 2 + 1;
for (int i = 1; i < m; i++)
{
ans += x[i] + y[i] + z[i] - x[m] - y[m] - z[m] + 3 * (m - i);
}
for (int i = m + 1; i <= n; i++)
{
ans += x[m] + y[m] + z[m] - x[i] - y[i] - z[i] + 3 * (i - m);
}
out << ans;
in.close();
out.close();
return 0;
}