本题为洛谷:
本题用到sort排序,如果不理解可以去看sort :
#include<bits/stdc++.h>
using namespace std;
struct mountain{
int x,y,z;
}a[50001];
bool cmp(mountain b,mountain c){
return b.z>c.z;
}
double ans;
int main() {
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i].x>>a[i].y>>a[i].z;
}
sort(a,a+n,cmp);
for(int i=0;i<n-1;i++){
ans+=sqrt((a[i].x-a[i+1].x)*(a[i].x-a[i+1].x)+(a[i].y-a[i+1].y)*(a[i].y-a[i+1].y)+(a[i].z-a[i+1].z)*(a[i].z-a[i+1].z));
}
printf("%.3lf",ans);
return 0;
}