# include iostream include algorithm include math using namespace std do

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75``` ```#include #include #include using namespace std; double euclidean_distance(double x1, double y1, double x2, double y2) { return pow(pow(x2 - x1, 2) + pow(y2 - y1, 2), 0.5); } union coordinate { int integer; double _double; void init() { cin >> _double; if ((int) _double == _double) { integer = (int) _double; } } double get() { if (_double != NULL) return _double; return integer; } }; struct coordinate_system { coordinate x; coordinate y; double euclidean_distance; }; int compare(const void *a, const void *b) { coordinate_system *point1 = (coordinate_system *) a; coordinate_system *point2 = (coordinate_system *) b; return (point2->euclidean_distance - point1->euclidean_distance); } int main() { size_t dimension; printf("Enter the dimension of points array: "); cin >> dimension; struct coordinate_system points[dimension]; for (int i = 0; i < dimension; ++i) { cout << "Enter value of x for point[" << i << "]: "; points[i].x.init(); cout << "Enter value of y for point[" << i << "]: "; points[i].y.init(); points[i].euclidean_distance = euclidean_distance(0, 0, points[i].x.get(), points[i].y.get()); } cout << "Entered array:" << endl; for (int i = 0; i < dimension; ++i) { cout << "x = " << points[i].x.get() << "; y = " << points[i].y.get() << "; euclidean_distance = " << points[i].euclidean_distance << ";" << endl; } qsort(points, dimension, sizeof(coordinate_system), compare); cout << "Sorted array:" << endl; for (int i = 0; i < dimension; ++i) { cout << "x = " << points[i].x.get() << "; y = " << points[i].y.get() << "; euclidean_distance = " << points[i].euclidean_distance << ";" << endl; } } ```