代码:
#include<bits/stdc++.h>
using namespace std;
struct hz{
int x,y;
double z;
}a[1000006];
int n,m,k,jsq,ans,b[506],db[1006],x[1006],y[1006];
double cb;
double jl(int xx,int yy){
return sqrt((x[xx]-x[yy])*(x[xx]-x[yy])+(y[xx]-y[yy])*(y[xx]-y[yy]));
}
bool cmp(hz s,hz d){
return s.z<d.z;
}
int cz(int t){
if(db[t]==t) return t;
return db[t]=cz(db[t]);
}
int main(){
int xb,yb;
cin>>k;
for(int i=1;i<=k;i++) scanf("%d",&b[i]);
for(int i=1;i<=k;i++) db[i]=i;
cin>>n;
for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++){
m++;
a[m].x=i;
a[m].y=j;
a[m].z=jl(i,j);
}
sort(a+1,a+m+1,cmp);
for(int i=1;i<=m;i++){
xb=cz(a[i].x);
yb=cz(a[i].y);
if(xb!=yb){
db[yb]=xb;
jsq++;
}
if(jsq==n-1){
cb=a[i].z;
break;
}
}
for(int i=1;i<=k;i++) if(cb<=b[i]) ans++;
cout<<ans;
return 0;
}