Pagini recente » Cod sursa (job #1939149) | Cod sursa (job #2125628) | Cod sursa (job #2812412) | Cod sursa (job #618978) | Cod sursa (job #2616510)
#include <fstream>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int l[50002], c[50002];
int main() {
int n, a, b;
f>>n>>a>>b;
for(int i=0; i<n; i++) {
f>>l[i]>>c[i];
}
sort(l, l+n);
sort(c, c+n);
int sum=0;
for(int i=0; i<n/2; i++) {
if (l[n-i-1]-l[i]-a>0){
sum+=l[n-i-1]-l[i]-a;
}
if (c[n-i-1]-c[i]-b>0){
sum+=c[n-i-1]-c[i]-b;
}
}
g<<sum;
return 0;
}