#include <cstdio>
#include <algorithm>

using namespace std;

int v[50010],v1[50010];

int main()
{
    freopen("tribute.in","r",stdin);
    freopen("tribute.out","w",stdout);
    int n,Dx,Dy,a,b;
    long long sol=0;
    scanf("%d%d%d",&n,&Dx,&Dy);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&v[i],&v1[i]);
    a=1;
    b=n;
    sort(v+1,v+n+1);
    sort(v1+1,v1+n+1);
    while(a<=n)
    {
        if(v[a]-v[b]-Dx>=0)
            sol+=v[a]-v[b]-Dx;
        if(v1[a]-v1[b]-Dy>=0)
            sol+=v1[a]-v1[b]-Dy;
        a++;
        b--;
    }
    printf("%lld",sol);
    return 0;
}