(1)测试数据
2
1 0
0 1
(2)代码(思路在注释中)
#include <bits/stdc++.h>
using namespace std;
int n;
const int N = 2005;
int a[N][2];
double minDis = 1e9;
int main () {
double tmp;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i][0] >> a[i][1];
}
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
minDis = min(minDis, sqrt(a[i][0] * a[i][0] + a[i][1] * a[i][1]) +sqrt (a[j][0] * a[j][0] + a[j][1] * a[j][1]) + sqrt((a[i][0] - a[j][0]) * (a[i][0] - a[j][0]) + (a[i][1] - a[j][1]) * (a[i][1] - a[j][1])));
}
}
cout << fixed << setprecision(6) << minDis;
return 0;
}