Pagini recente » Cod sursa (job #3329786) | Cod sursa (job #3347115) | Cod sursa (job #3326249) | Borderou de evaluare (job #3325785) | Cod sursa (job #3315932)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("tribute.in");
ofstream fout("tribute.out");
int spx[50005];
int spy[50005];
vector<pair<int,int>> v;
int solve_line(int l,int sp[])
{
int ans=INT_MAX;
for(int i=1;i<=50001-l+1;i++)
{
int j=i+l-1;
int cnt=sp[i-1]-sp[0];
cnt+=sp[50001]-sp[j];
ans=min(ans,cnt);
}
return ans;
}
int main()
{
int n,dx,dy,x,y;
fin>>n>>dx>>dy;
for(int i=0;i<n;i++)
{
fin>>x>>y;
x++;
y++;
spx[x]++;
spy[y]++;
v.push_back({x,y});
}
for(int i=1;i<=50001;i++)
{
spx[i]+=spx[i-1];
spy[i]+=spy[i-1];
}
int ans=min(solve_line(dx,spx),solve_line(dy,spy));
fout<<ans;
return 0;
}