Cod sursa(job #3156052)
Utilizator | Data | 10 octombrie 2023 14:51:46 | |
---|---|---|---|
Problema | Tribute | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int n,i,a,b,x[50001],y[50001],s;
int main()
{
for(f>>n>>a>>b,i=1;i<=n;++i)
f>>x[i]>>y[i];
for(sort(x+1,x+n+1),sort(y+1,y+n+1),i=1;i<=n/2;++i)
s+=max(x[n-i+1]-x[i]-a,0)+max(y[n-i+1]-y[i]-b,0);
g<<s;
return 0;
}