Pagini recente » Cod sursa (job #438279) | Cod sursa (job #1315109) | Cod sursa (job #2482602) | Cod sursa (job #2525149) | Cod sursa (job #2782578)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin ( "tribute.in" );
ofstream cout ( "tribute.out" );
#define NMAX 50000
int x[NMAX + 5], y[NMAX + 5];
int main() {
int n, dx, dy, i, j, ans;
cin >> n >> dx >> dy;
for ( i = 0; i < n; i++ ) {
cin >> x[i] >> y[i];
}
sort ( x, x + n );
sort ( y, y + n );
ans = 0;
for ( i = 0; i < n; i++ ) {
if ( x[i] - x[n - i - 1] > dx) {
ans += x[i] - x[n - i - 1] - dx;
}
if ( y[i] - y[n - i - 1] > dy) {
ans += y[i] - y[n - i - 1] - dy;
}
}
cout << ans;
return 0;
}