#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int N = 100010;
int n; ll X, Y, Z;
int a[N], b[N];
namespace subtask2 {
    priority_queue<pii, vector<pii>, greater<pii>> q;
    void main() {
//        printf("In sub2:\n");
        for (int i = 1; i <= n; i++) 
            if(a[i] > b[i]) q.push({i, a[i] - b[i]});
        ll eps1 = 0, eps2 = 0, ans = 0;
        for (int i = 1; i <= n; i++) {
            if(a[i] >= b[i]) continue;
            ll delta = b[i] - a[i];
            while(q.size() && q.top().second <= delta) {
                delta -= q.top().second;
                ans += 1ll * abs(i - q.top().first) * q.top().second;
                q.pop();
            }
            if(delta && q.size()) {
                pii pr = q.top(); q.pop();
                ans += 1ll * abs(i - pr.first) * delta;
                q.push({pr.first, pr.second - delta});
                delta = 0;
            }
            if(delta) eps1 += delta;
        }
        while(q.size()) eps2 += q.top().second, q.pop();
        if(eps1) ans += X * eps1;
        if(eps2) ans += Y * eps2;
        printf("%lld\n", ans);
    }
}

namespace subtaskall {
    priority_queue<pii> q1, q2; // q1 存溢出，q2 存缺少，第一维放坐标，第二维放 size
    void main() {
        ll ans = 0;
        for (int i = 1; i <= n; i++) {
            if(a[i] < b[i]) {
                int delta = b[i] - a[i];
                while(q1.size() && delta) {
                    int j = q1.top().first, D = q1.top().second, d1 = min(q1.top().second, delta);
                    if((i - j) * Z > X + Y) ans += d1 * (X + Y);
                    else ans += d1 * (i - j) * Z;
                    delta -= d1;
                    q1.pop();
                    if(D > d1) q1.push({j, D - d1});
                }
                if(delta) q2.push({i, delta});
            } else if(a[i] > b[i]) {
                int delta = a[i] - b[i];
                while(q2.size() && delta) {
                    int j = q2.top().first, D = q2.top().second, d1 = min(q2.top().second, delta);
                    if((i - j) * Z > X + Y) ans += d1 * (X + Y);
                    else ans += d1 * (i - j) * Z;
                    delta -= d1;
                    q2.pop();
                    if(D > d1) q2.push({j, D - d1});
                }
                if(delta) q1.push({i, delta});
            }
        }
        while(q2.size()) ans += X * q2.top().second, q2.pop();
        while(q1.size()) ans += Y * q1.top().second, q1.pop();
        printf("%lld\n", ans);
    }
}

int main() {
//    freopen("A1.in", "r", stdin);
//    freopen("A.out", "w", stdout);
    scanf("%d%lld%lld%lld", &n, &X, &Y, &Z);
    for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
    if(X == Y && X == 1e8 && Z == 1) subtask2::main();
    else subtaskall::main();
    return 0;
}