HDU 1173 采矿

像这种找最短距离的,只要先排序,然后找中间点就可以了,哈哈,跟着类似的还有 2083 简易板之间最短距离

#include<stdio.h>
#include<stdlib.h>
int n;
double x[1000005],y[1000005];
int cmp( const void *a,const void *b )
{
    return *( ( double * )a ) > *( ( double * )b ) ? 1 : -1;
}
int main( )
{
    while( scanf( "%d",&n ),n )
    {
           for( int 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 );
           double mx,my;
           mx = x[n/2],my = y[n/2];
           printf( "%.3lf %.3lf\n",mx,my );
           }
    return 0;
}