Pagini recente » Cod sursa (job #2725113) | Cod sursa (job #296193) | Cod sursa (job #1787823) | Cod sursa (job #1995907) | Cod sursa (job #2634059)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("tribute.in");
ofstream fout("tribute.out");
typedef long long ll;
const int NMAX = 5e4 + 5;
vector<int> l(NMAX), r(NMAX);
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
int n, dx, dy, rez = 0;
fin >> n >> dx >> dy;
for (int i = 0; i < n; ++i)
fin >> l[i] >> r[i];
sort(l.begin(), l.begin() + n), sort(r.begin(), r.begin() + n);
for (int i = 0; i < n / 2; ++i)
rez += max(l[n - i - 1] - l[i] - dx, 0) + max(r[n - i - 1] - r[i] - dy, 0);
fout << rez;
return 0;
}