【洛谷】P5143 攀爬者

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

int n;

struct p{
    int x;
    int y;
    int z;
}ps[50010];

bool cmp(struct p a, struct p b){
    return a.z < b.z;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    cin >> n;
    int x, y, z;
    for (int i = 0; i < n; i++){
        cin >> ps[i].x >> ps[i].y >> ps[i].z;
    }
    sort(ps, ps+n, cmp);
    double sum = 0.0;
    struct p pre = ps[0];
    for (int i = 1; i < n; i++){
        sum += sqrt((ps[i].x-pre.x)*(ps[i].x-pre.x)+(ps[i].y-pre.y)*(ps[i].y-pre.y)+(ps[i].z-pre.z)*(ps[i].z-pre.z));
        pre = ps[i];
    }
    printf("%.3lf", sum);
    return 0;
}