Cod sursa(job #2905580)
| Utilizator | Data | 22 mai 2022 15:37:49 | |
|---|---|---|---|
| Problema | Tribute | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("tribute.in");
ofstream out ("tribute.out");
const int dim = 5e4+1;
int x[dim], y[dim];
int main()
{
int n, dx, dy;
in >> n >> dx >> dy;
for (int i=1; i<=n; i++)
in >> x[i] >> y[i];
sort (x+1, x+n+1);
sort (y+1, y+n+1);
int ans = 0;
for (int i=1; i<=n; i++)
{
if (x[n-i+1] - x[i] <= dx)
break;
ans += x[n-i+1] - x[i] - dx;
}
for (int i=1; i<=n; i++)
{
if (y[n-i+1] - y[i] <= dy)
break;
ans += y[n-i+1] - y[i] - dy;
}
out << ans;
return 0;
}
