Submission

[PPPPP][PPP][PPTSSSS]

Score: 50

User: pxsit

Problemset: 05.Two Towers

Language: cpp

Time: 1.085 second

Submitted On: 2025-03-31 07:57:47

#pragma GCC optimize("Ofast,fast-math,unroll-loops,no-stack-protector,unsafe-math-optimizations,inline,inline-small-functions,inline-functions")
#include <bits/stdc++.h>
#pragma GCC target("avx2,bmi,bmi2,sse4.2,popcnt,lzcnt,tune=native")
#define endl '\n'
#define endll cout << '\n';
#define sp ' '
#define cinn int n;cin>> n;
#define testcase int t;cin>>t;while(t--)
const int INF = 1e9;
const long long LINF = 1e18;
const int mod = 1e9+7;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

struct tower{
    int l,h;
};

int32_t main(){ios::sync_with_stdio(false); cin.tie(nullptr);
    int n;
    cin >> n;
    vector<tower> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i].l >> a[i].h;
    }
    int mx = 0;
    // sort(a.begin(),a.end());
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            mx = max(mx,((abs(a[i].l-a[j].l)*(min(a[i].h,a[j].h)))));
        }
    }
    cout << mx;
}