#include using namespace std; int main() { int n, x, y, c = 0, max_1 = 0, min_1 = 2147483647, max_2 = 0, min_2 = -2147483647, far_11 = 0, far_12 = 0, far_21 = 0,far_22 = 0; double S_1, S_2; cout << "number of coordinates" <> n; cout << "coordinates" << endl; for (int i = 0; i < n; i++) { cin >> x >> y; if (x == 0) { c++; } if (y > max_1 && x==0) { max_1 = y; } if (y < min_1 && y > 0 && x==0) { min_1 = y; } if (y < max_2 && x==0) { max_2 = y; } if (y > min_2 && y < 0 && x==0) { min_2 = y; } if (x > far_11 && y > 0) { far_11 = x; } if (x < far_12 && y > 0) { far_12 = x; } if (x > far_21 && y < 0) { far_21 = x; } if (x < far_22 && y < 0) { far_22 = x; } } far_12 = far_12 * -1; far_22 = far_22 * -1; max_2 = max_2 * -1; min_2 = min_2 * -1; if (c < 2) { cout << "0"; } else if (far_11 > far_12) { S_1 = max_1 - min_1; S_1 = S_1/2; S_1 = S_1*far_11; } else if (far_11 <= far_12) { S_1 = max_1 - min_1; S_1 = S_1/2; S_1 = S_1*far_12; } else if (far_21 > far_22) { S_2 = max_2 - min_2; S_2 = S_2; S_2 = S_2*far_21; } else if (far_21 <= far_22) { S_2 = max_2 - min_2; S_2=S_2; S_2 = S_2*far_22; } if (S_1 > S_2) { cout << S_1; } else if (S_1 <= S_2) { cout << S_2; } }

triangle with the largest area. one of edge lies on y. triangle have no intersection whit x.