#include <fstream>
#include <algorithm>
#define nmax 50005

using namespace std;

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

int n,dx,dy,a[nmax],b[nmax];
long long rez;

inline void read()
{
    fin>>n>>dx>>dy;
    for(int i=1;i<=n;i++)
        fin>>a[i]>>b[i];
    fin.close();
}

inline void solve()
{
    int i=1,j=n;

    sort(a+1,a+n+1);
    sort(b+1,b+n+1);

    while(i<=n && j)
    {
        if(a[i]-a[j]-dx>0)
            rez+=a[i]-a[j]-dx;
        if(b[i]-b[j]-dy>0)
            rez+=b[i]-b[j]-dy;
        i++;
        j--;
    }
}

int main()
{
    read();
    solve();
    fout<<rez;
    fout.close();
    return 0;
}