The Closest Pair Problem
题目描述
[problemUrl]: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=14&page=show_problem&problem=1186
[PDF](https://uva.onlinejudge.org/external/102/p10245.pdf)
![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10245/c3f8541dec8028e9d183996ab37face8f4812f49.png)
输入输出格式
输入格式
![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10245/98cb3ac454f889d38c8f922e9cd333195a1e7f41.png)
输出格式
![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10245/7704f2bda036a86137bf9b3d2d7f98049ec262ae.png)
输入输出样例
输入样例 #1
3
0 0
10000 10000
20000 20000
5
0 2
6 67
43 71
39 107
189 140
0
输出样例 #1
INFINITY
36.2215