Разработать программу для нахождения пары самых удаленных друг от друга точек

#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <vector>
 
struct Point {
  int x, y;
  Point(int x_, int y_) : x(x_), y(y_) {}
};
 
inline float Distance(const Point &a, const Point &b) {
  return sqrt(pow(a.x - b.x, 2.) + pow(a.y - b.y, 2.));
}
 
int main(int argc, char *argv[]) {
  srand(time(NULL));
  int number_of_points = 15 + rand() % 6;
  std::vector<Point> points;
  for (int i = 0; i < number_of_points; ++i) {
    Point new_point(rand() % 100, rand() % 100);
    printf("(%d, %d) ", new_point.x, new_point.y);
    points.push_back(Point(new_point));
  }
  printf("\n");
 
  Point max_a = points[0], max_b = points[1];
  float max_distance;
  for (int i = 0; i < number_of_points - 1; ++i)
    for (int j = i; j < number_of_points; ++j) {
      float distance = Distance(points[i], points[j]);
      if (distance > max_distance) {
        max_a = points[i];
        max_b = points[j];
        max_distance = distance;
      }
    }
 
  printf("Max distance (%d, %d) - (%d, %d) = %f\n", max_a.x, max_a.y,
         max_b.x, max_b.y, max_distance);
  return 0;
}