import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt(); //一共n组数据
int m = in.nextInt(); //每个集合有m个数
int[][] a = new int[m][2];
int[][] b = new int[m][2];
double[] dis = new double[n];
for(int i =0;i<n;i++)
{
for(int j=0;j<m;j++)
{
a[j][0] = in.nextInt();
a[j][1] = in.nextInt();
}
for(int j=0;j<m;j++)
{
b[j][0] = in.nextInt();
b[j][1] = in.nextInt();
}
dis[i] = getDistance(a,b);
}
for(int i =0;i<n;i++)
System.out.println(String.format("%.3f",dis[i]));
}
public static double getDistance (int[][] a,int[][] b)
{
double minDis = distance(a[0][0],b[0][0],a[0][1],b[0][1]);
double curDis = 0;
int k =0;
for(int i =0;i<a.length;i++)
{
for (int j=0;j<b.length;j++) {
curDis = distance(a[i][0],b[j][0],a[i][1],b[j][1]);
if(curDis<=minDis)
minDis = curDis;
}
}
return minDis;
}
public static double distance (int a,int b,int c,int d)
{
double dis = Math.sqrt((a-b)*(a-b)+(c-d)*(c-d));
return dis;
}
}
z这是第二题求最短距离,做法比较暴力,但也不会一个也不通过吧
#腾讯春招##笔试题目#