#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <cstring>
#include <ctime>
#include <cassert>
#include <utility>

using namespace std;

#define MAXN 50005
#define INF 2e9
int N, DX, DY;
int X[MAXN], Y[MAXN];
unsigned int sum[MAXN];

unsigned int go(int D[], int DX) {
    sum[0] = D[0];
    for(int i = 1; i < N; i++)
        sum[i] = sum[i - 1] + D[i];

    int st, dr;
    unsigned int ret, crt;
    st = 0;
    dr = 0;
    ret = INF;

    vector<int> px;
    for(int i = 0; i < N; i++) {
        px.push_back(D[i] - DX);
        px.push_back(D[i]);
    }
    sort(px.begin(), px.end());

    for(vector<int> :: iterator it = px.begin(); it != px.end(); it++) {
        int i = *it;
        while(st < N && D[st] < i)
            st++;
        if(st == N)
            break;
        while(dr + 1 < N && D[dr + 1] <= i + DX)
            dr++;

        // left
        crt = (unsigned int)st * i - (st > 0 ? sum[st - 1] : 0);
        // right
        crt += sum[N - 1] - sum[dr] - (unsigned int)(N - 1 - dr) * (unsigned int)(i + DX);

        ret = min(ret, crt);
    }

    return ret;
}

int main() {
	freopen("tribute.in", "r", stdin);
	freopen("tribute.out","w", stdout);

    scanf("%d %d %d", &N, &DX, &DY);
    for(int i = 0; i < N; i++)
        scanf("%d %d", &X[i], &Y[i]);

    sort(X, X + N);
    sort(Y, Y + N);

    int ans = (int)(go(X, DX) + go(Y, DY));

    printf("%d\n", ans);

	return 0;
}