三角形

#include<algorithm>
using namespace std;
const int N = 110;
pair<int,int> a[N];
#define x first
#define y second
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++)cin >> a[i].x >> a[i].y;
    int ans = 0;
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= n ; j ++)
        {
            for(int k = 1; k <= n; k ++)
            {
                if(i != k && i != j && j != k)
                {
                    if(a[i].x==a[j].x&&a[j].y==a[k].y)
                    {
                        ans = max(ans, abs(a[i].x - a[k].x) * abs(a[i].y - a[j].y));
                    }
                }
            }
        }
    }
    cout << ans << endl;
}