CSP 2020年9月份 01题 称检测点查询

题目简单，直接粘贴代码块

#include <iostream>
#include <cmath>
const int N=200;
using namespace std;
int main(){
	int n, X, Y, x[N], y[N]; 
	double distance[N], min, max=0 ;
	int tip;
	int i, j, k;
	cin>>n>>X>>Y;
	for ( i=0; i<n; i++ ){
		cin>>x[i]>>y[i];
		distance[i] = pow( (X-x[i])*(X-x[i]) + (Y-y[i])*(Y-y[i]) , 0.5 );
//		cout<<"distacne = "<<distance[i]<<endl;
	}
	for ( i=0; i<n; i++ ){
		max = max>distance[i]? max:distance[i];
	}
//	cout<<"max = "<<max<<endl;
	for ( int j=0; j<3; j++ ){
		min = max+1;
		for ( i=0; i<n; i++ ){
			if ( min > distance[i]){
				min = distance[i];
				tip = i;
			}	
		}
		cout<<tip+1<<endl;
		distance[tip] = max+1;
	} 	
	return 0;
}