Cod sursa(job #1726160)
Utilizator | Andrei Cotor Andrei_Cotor | Data | 7 iulie 2016 14:11:42 |
---|---|---|---|
Problema | Tribute | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("tribute.in");
ofstream fo("tribute.out");
int A[50001],B[50001];
int n,a,b,i,rez;
int main()
{
fi>>n>>a>>b;
for(i= 1; i<=n; i++)
fi>>A[i]>>B[i];
sort(A+1,A+n+1);
sort(B+1,B+n+1);
rez=0;
for(i=1; i<=n; i++)
{
if(A[n-i+1]-A[i]-a>0)
rez=rez+A[n-i+1]-A[i]-a;
if(B[n-i+1]-B[i]-b>0)
rez=rez+B[n-i+1]-B[i]-b;
}
fo<<rez<<"\n";
fi.close();
fo.close();
return 0;
}