Cod sursa(job #1572298)
| Utilizator | Data | 18 ianuarie 2016 20:46:43 | |
|---|---|---|---|
| Problema | Tribute | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("tribute.in");
ofstream fout ("tribute.out");
int N,Dx,Dy,s,X[50000],Y[50000];
void citire()
{
fin>>N>>Dx>>Dy;
for(int i=1;i<=N;i++)
fin>>X[i]>>Y[i];
}
void rezolvare()
{
sort(X+1,X+1+N);
sort(Y+1,Y+1+N);
for(int i=1;i<=N/2;i++)
{
s=s+max(X[N-i+1]-X[i]-Dx,0);
s=s+max(Y[N-i+1]-Y[i]-Dy,0);
}
}
int main()
{
citire();
rezolvare();
fout<<s<<'\n';
return 0;
}
