#include<stdio.h>
#include<stdlib.h>
double x[1000000],y[1000000];
int cmp(const void *a,const void *b)
{
return *(double *)a>*(double *)b?1:-1;
}
int main()
{
int n,i;
while(scanf("%d",&n),n)
{
for(i=0;i<n;i++)
scanf("%lf%lf",&x[i],&y[i]);
qsort(x,n,sizeof(x[0]),cmp);
qsort(y,n,sizeof(y[0]),cmp);
if(n%2==0)
printf("%.2f %.2f\n",(x[n/2]+x[(n-1)/2])/2,(y[n/2]+y[(n-1)/2])/2);
else printf("%.2f %.2f\n",x[n/2],y[n/2]);
}
return 0;
}
hdu 1173 采矿
最新推荐文章于 2018-11-09 13:25:00 发布