Pagini recente » Cod sursa (job #595198) | Cod sursa (job #1521075) | Cod sursa (job #108222) | Cod sursa (job #2377287) | Cod sursa (job #601446)
Cod sursa(job #601446)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int dist_min (vector <int> X, int Dx)
{
int Min = 500000000, s = 0, i, j;
for (i = 0; i <= ((int) X.size ()) - 1 - Dx; i++)
{
s = 0;
for (j = 0; j < X.size (); j++)
{
if (X[j] != 0)
if (j < i)
s += X[j] * (i - j);
else
if (i + Dx < j)
s += X[j] * (j - i - Dx);
if (s > Min)
break;
}
Min = min (s, Min);
}
Min = min (s, Min);
return Min;
}
int main () {
ifstream in ("tribute.in");
ofstream out ("tribute.out");
int n, dx, dy, i, x, y;
in >> n >> dx >> dy;
vector <int> X (n), Y (n);
for (i = 0; i < n; i++)
{
in >> x >> y;
if (x >= X.size())
X.resize (x + 1);
if (y >= Y.size())
Y.resize (y + 1);
X[x] ++;
Y[y] ++;
}
out << dist_min (X, dx) + dist_min (Y, dy);
return 0;
}