#include <bits/stdc++.h>

using namespace std;

ifstream f("tribute.in");
ofstream g("tribute.out");

const int N = 5e4 + 1;
int n, dx, dy;
int x[N], y[N];

int distanta(int v[], int lat){
    int ret = 0;
    for(int i = 0, j = n - 1; i < j && j > i;){
        if(v[j] - v[i] - lat > 0){
            ret += v[j] - v[i] - lat;
            i++;
            j--;
        }
    }

    return ret;
}

int main(){
    f >> n >> dx >> dy;
    for(int i = 0; i < n; i++)
        f >> x[i] >> y[i];

    f.close();

    sort(x, x + n);
    sort(y, y + n);

    g << distanta(x, dx) + distanta(y, dy);
    g.close();
}