codeforces 589 B

B - Layer Cake

Time Limit:6000MS     Memory Limit:524288KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 589B

Description

Dasha decided to bake a big and tasty layer cake. In order to do that she went shopping and bought n rectangular cake layers. The length and the width of the i-th cake layer were a_i and b_i respectively, while the height of each cake layer was equal to one.

From a cooking book Dasha learned that a cake must have a form of a rectangular parallelepiped constructed from cake layers of the same sizes.

Dasha decided to bake the biggest possible cake from the bought cake layers (possibly, using only some of them). It means that she wants the volume of the cake to be as big as possible. To reach this goal, Dasha can cut rectangular pieces out of the bought cake layers. She always cuts cake layers in such a way that cutting lines are parallel to the edges of that cake layer. Dasha isn't very good at geometry, so after cutting out a piece from the original cake layer, she throws away the remaining part of it. Also she can rotate a cake layer in the horizontal plane (swap its width and length).

Dasha wants her cake to be constructed as a stack of cake layers of the same sizes. Each layer of the resulting cake should be made out of only one cake layer (the original one or cut out from the original cake layer).

Help Dasha to calculate the maximum possible volume of the cake she can bake using given cake layers.

Input

The first line contains an integer n(1 ≤ n ≤ 4000) — the number of cake layers that Dasha can use.

Each of the following n lines contains two integer numbers a_i and b_i(1 ≤ a_i, b_i ≤ 10⁶) — the length and the width of i-th cake layer respectively.

Output

The first line of the output should contain the maximum volume of cake that can be baked using given layers.

The second line of the output should contain the length and the width of the resulting cake. If there are many solutions with maximum possible volume, print any of them.

Sample Input

Input

5
5 12
1 1
4 6
6 4
4 6

Output

96
6 4

Input

2
100001 900000
900001 100000

Output

180000000000
900000 100000

Hint

In the first example Dasha doesn't use the second cake layer. She cuts 4 × 6 rectangle from the first cake layer and she uses other cake layers as is.

In the second example Dasha cuts off slightly from the both cake layers.

巧妙得利用了set....

注意因为可能有重复元素。。。所以要用multiset...

然后有点喜欢上用pair了hhh

队友是二维bit+熔池过掉的。。。。

/*************************************************************************
    > File Name: code/hust/20151025/BB.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年10月27日 星期二 14时34分16秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
                 
#define yn hez111qqz
#define j1 cute111qqz
#define ms(a,x) memset(a,x,sizeof(a))
#define sec second
#define fir first
using namespace std;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
typedef long long LL;
typedef double DB;
const int inf = 0x3f3f3f3f;

const int N=4E3+7;
int n;
LL mx,cura,curb;
pair<LL,LL> a[N];
multiset<LL> se;
multiset<LL> ::iterator it;
int main()
{
  #ifndef  ONLINE_JUDGE 
   freopen("in.txt","r",stdin);
  #endif

   scanf("%d",&n);
   for ( int i = 0 ; i < n ; i++)
    {
    scanf("%lld %lld",&a[i].fir,&a[i].sec);
    if (a[i].fir>a[i].sec) swap(a[i].fir,a[i].sec);
    }
   sort(a,a+n);
   mx = -1;
   for ( int i = n -1 ; i >= 0 ; i--)
   {
       se.insert(a[i].sec);
       it =se.begin();
       for ( int j = i ; j < n ; j++)
    {
        LL tmp =a[i].fir*(*it)*(n-j);
        if (tmp>mx)
        {
        mx = tmp;
        cura = a[i].fir;
        curb = *it;
        }
        it++;
    }
   }
   printf("%lld
%lld %lld
",mx,curb,cura);
  
   
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}