#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("tribute.in");
ofstream fout ("tribute.out");

int n, dx, dy;
int a[50005], b[50005];

int main() {
    fin >> n >> dx >> dy;
    for (int i = 1; i <= n; i++)
        fin >> a[i] >> b[i];
    sort (a + 1, a + 1 + n);
    sort (b + 1, b + 1 + n);
    int i = 1, j = n, distanta = 0;
    while (i <= j) {
        if (a[j] - a[i] - dx > 0)
            distanta += a[j] - a[i] - dx;
        i++;
        j--;
    }
    i = 1, j = n;
    while (i <= j) {
        if (b[j] - b[i] - dy > 0)
            distanta += b[j] - b[i] - dy;
        i++;
        j--;
    }
    fout << distanta << "\n";
    return 0;
}