#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
int n;
int x[50000];
int y[50000];
long long maxim;
int dx,dy;
int main()
{

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

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

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

    int i=0;
    int j=n-1;
    while(i<n&&j>=0)
    {
        if(x[i]-x[j]-dx>0)
        maxim=maxim+x[i]-x[j]-dx;
        if(y[i]-y[j]-dy>0)
        maxim=maxim+y[i]-y[j]-dy;
        i++;
        j--;
    }
    g<<maxim;



}