Cod sursa(job #1767139)
Utilizator | Data | 28 septembrie 2016 19:09:25 | |
---|---|---|---|
Problema | Tribute | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int n,dx,dy,x[50003],y[50003];
long long sol;
int main()
{
f>>n>>dx>>dy;
for(i=1;i<=n;i++)
f>>x[i]>>y[i];
sort(x+1,x+n+1);
sort(y+1,y+n+1);
i=1;j=n;
while(i<=n && j>=1)
{
if(x[i]-x[j]-dx>0) sol+=x[i]-x[j]-dx;
if(y[i]-y[j]-dy>0) sol+=y[i]-y[j]-dy;
i++; j--;
}
g<<sol<<'\n';
f.close();
g.close();
return 0;
}