Pagini recente » Cod sursa (job #3329217) | Cod sursa (job #3327737) | Cod sursa (job #3320376) | Cod sursa (job #3344911) | Cod sursa (job #3353724)
#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
using namespace std;
int vl[50005];
int vc[50005];
int main()
{
freopen("tribute.in", "r", stdin);
freopen("tribute.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, dx, dy;
cin >> n >> dx >> dy;
for (int i=1; i<=n; i++) {
cin >> vl[i] >> vc[i];
}
sort(vl+1, vl+n+1);
sort(vc+1, vc+n+1);
long long suma=0, diff;
for (int i=1; i<=n/2; i++) {
diff=vl[n-i+1]-vl[i]-dx;
suma+=diff;
diff=vc[n-i+1]-vc[i]-dy;
suma+=diff;
}
cout << suma;
return 0;
}