CTNEWS - Lâu đài cát
Tác giả: khuc_tuan
Ngôn ngữ: C++
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <sstream>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define Rep(i,n) for(int i=0,lll=(n);i<lll;++i)
#define For(i,a,b) for(int i=(a),lll=(b);i<=lll;++i)
#define Ford(i,a,b) for(int i=(a),lll=(b);i>=lll;--i)
#define pb push_back
#define MP make_pair
#define fi first
#define se second
#define nextint __nextint()
inline int __nextint() { int x; scanf("%d", &x); return x; }
int n = nextint;
long long x = nextint, y = nextint;
int a[25000], b[25000];
int main() {
Rep(i,n) scanf("%d%d", a+i, b+i);
sort( a, a + n);
sort( b, b + n);
long long res = 0;
Rep(i,n) {
if(a[i] < b[i]) res += x * (b[i]-a[i]);
else res += y * (a[i] - b[i]);
}
cout << res << endl;
// system("pause");
return 0;
}