帮帮本蒟蒻!!!
  • 板块P5143 攀爬者
  • 楼主Ye_Cha
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/11/26 20:05
  • 上次更新2024/11/26 21:20:46
查看原帖
帮帮本蒟蒻!!!
1142704
Ye_Cha楼主2024/11/26 20:05
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
struct p
{
    int x; int y; int z;
};

bool cmp(p a, p b) 
{ 
    if (a.z != b.z)
        return a.z < b.z;
    else return false;
}
int main()
{
    int n; cin >> n; vector<p> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].x >> a[i].y >> a[i].z;
    }
    sort(a.begin(), a.end(), cmp);
    int ae = a.size() - 1;
    double ans= static_cast<double>(sqrt(pow((a[0].x - a[ae].x), 2) + pow((a[0].y - a[ae].y), 2) + pow((a[0].z - a[ae].z), 2)));
    cout << fixed << setprecision(3) << ans;
    return 0;
}
2024/11/26 20:05
加载中...