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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
#include <iostream>
#include <chrono>
using namespace std;
struct point
{
int x;
int y;
};
void print(const point& ptr)
{
cout << ptr.x << " " << ptr.y << endl;
}
point readPoint()
{
int x, y;
cin >> x >> y;
return{ x, y };
}
double getDist(const point& origin, const point& dest)
{
double dx = origin.x - dest.x;
double dy = origin.y - dest.y;
return sqrt(dx*dx + dy*dy);
}
struct triangle
{
point p1;
point p2;
point p3;
};
double getArea(const triangle& tr)
{
double sideA = getDist(tr.p1, tr.p2);
double sideB = getDist(tr.p2, tr.p3);
double sideC = getDist(tr.p3, tr.p1);
double halfP = (sideA + sideB + sideC) / 2;
return sqrt(halfP * (halfP - sideA) * (halfP - sideB) * (halfP - sideC));
}
void print(const triangle& tr)
{
cout << "Point1: ";
print(tr.p1);
cout << "Point2: ";
print(tr.p2);
cout << "Point3: ";
print(tr.p3);
cout << getArea(tr) << endl << endl;
}
void swap(int * arr, int i, int j)
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
void swap(triangle* arr, int i, int j)
{
triangle temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
void selectionSort(int* areas, triangle* triangles, int len)
{
for (int i = 0; i < len-1; i++)
{
int currPos = i;
int min = i;
for (int j = i; j < len; j++)
{
if (areas[j] < areas[min])
min = j;
}
if (min != i)
{
swap(areas, i, min);
swap(triangles, i, min);
}
}
}
int main()
{
int n;
cin >> n;
triangle* triangles = new triangle[n];
for (int i = 0; i < n; i++)
{
point p1 = readPoint();
point p2 = readPoint();
point p3 = readPoint();
triangles[i].p1 = p1;
triangles[i].p2 = p2;
triangles[i].p3 = p3;
}
int* areas = new int[n];
for (int i = 0; i < n; i++)
areas[i] = getArea(triangles[i]);
selectionSort(areas, triangles, n);
for (int i = 0; i < n; i++)
print(triangles[i]);
delete[] triangles;
delete[] areas;
}
|
