Pagini recente » Cod sursa (job #2064627) | Cod sursa (job #2775628) | Cod sursa (job #966161) | Cod sursa (job #396313) | Cod sursa (job #1725495)
#include <bits/stdc++.h>
using namespace std;
int mx=INT_MAX,my=INT_MAX,n,dx,dy,x,y,xin[50010],xsf[50010],yin[50010],ysf[50010],i,in;
int main()
{
freopen("tribute.in","r",stdin);
freopen("tribute.out","w",stdout);
scanf("%d%d%d",&n,&dx,&dy);
for(i=1; i<=n; ++i)
{
scanf("%d%d",&x,&y);
xin[x]++;
xsf[x]++;
yin[y]++;
ysf[y]++;
}
for(in=1; in<=2; ++in)
{
for(i=0; i<=50000; ++i)
{
xsf[i]+=xsf[i-1];
ysf[i]+=ysf[i-1];
}
for(i=50000; i>=0; --i)
{
xin[i]+=xin[i+1];
yin[i]+=yin[i+1];
}
}
for(i=0; i<=50000; ++i)
{
if(i+dx<=50000&&xsf[i-1]+xin[i+dx+1]<mx)mx=xsf[i-1]+xin[i+dx+1];
if(i+dy<=50000&&ysf[i-1]+yin[i+dy+1]<my)my=ysf[i-1]+yin[i+dy+1];
}
printf("%d\n",mx+my);
return 0;
}