Pagini recente » Cod sursa (job #2186987) | Istoria paginii runda/simulare_oji_2011/clasament | Cod sursa (job #2068664) | Cod sursa (job #2073025) | Cod sursa (job #1567983)
#include<cstdio>
#include<algorithm>
using namespace std;
int countx[50010],county[50010];
long long get_answer(int points[50010],int length){
int i,up=0,down=0;
long long sum=0,answer=2000000000000000;
for(i=50000;i>=length;i--){
up+=points[i];
sum+=up;
}
for(i=0;i<=50000-length;i++){
sum-=up;
up-=points[i+length];
answer=min(answer,sum);
down+=points[i];
sum+=down;
}
return answer;
}
int main(){
freopen("tribute.in","r",stdin);
freopen("tribute.out","w",stdout);
int n,dx,dy,x,y,i;
scanf("%d%d%d",&n,&dx,&dy);
for(i=1;i<=n;i++){
scanf("%d%d",&x,&y);
countx[x]++;
county[y]++;
}
printf("%lld",get_answer(countx,dx)+get_answer(county,dy));
return 0;
}