H. Twin Buildings

http://codeforces.com/contest/1252/problem/H

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=1e5+9;

pair<ll,ll>p[N];

int main()
{
    FAST_IO;

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].first>>p[i].second;
        if(p[i].first>p[i].second) swap(p[i].first,p[i].second);
    }

    sort(p+1,p+1+n);

    ll ans=p[n].first*p[n].second;

    ll maxx=p[n].second;
    for(int i=n-1;i>=1;i--)
    {
        ans=max(ans,p[i].first*p[i].second);
        ans=max(ans,p[i].first*min(maxx,p[i].second)*2);
        maxx=max(maxx,p[i].second);
    }

    cout<<ans/2;
    if(ans%2) cout<<".5";
    else cout<<".0";
    cout<<endl;

    return 0;
}