#include <fstream>
#include <algorithm>
using namespace std;
int n,i,j,dx,dy,a[50005],b[50005];
long long rez;
int main()
{
    ifstream f("tribute.in");
    ofstream g("tribute.out");
    f>>n>>dx>>dy;
    for(i=1; i<=n; i++)
        f>>a[i]>>b[i];
    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--;
    }
    g<<rez<<'\n';
    f.close(); g.close();
    return 0;
}