Dotcpp  >  编程题库  >  Twin Buildings(H)
题目 2201:

Twin Buildings(H)

时间限制: 1Sec 内存限制: 256MB 提交: 11 解决: 5

题目描述

As you might already know, space has always been a problem in ICPC Jakarta. To cope with this, ICPC Jakarta is planning to build two new buildings. These buildings should have a shape of a rectangle of the same size. Now, their problem is to find land to build the buildings.

There are Nlands available for sale. The ith land has a rectangular shape of size Li×Wi  For a good feng shui, the building's side should be parallel to the land's sides.

One way is to build the two buildings on two different lands, one on each land (not necessarily with the same orientation). A building of size A×B can be build on the ith land if and only if at least one of the following is satisfied:

·   ALi and BWi  or

·   AWi and BLi .

Alternatively, it is also possible to build two buildings of A×Bon the ith land with the same orientation. Formally, it is possible to build two buildings of A×B on the ith land if and only if at least one of the following is satisfied:

·   A×2≤Li and BWi, or

·   A×2≤Wi and BLi, or

·   ALi and B×2≤Wi, or

·   AWi and B×2≤Li.

Your task in this problem is to help ICPC Jakarta to figure out the largest possible buildings they can build given N available lands. Note that ICPC Jakarta has to build two buildings of A×B; output the largest possible for A×B.


输入格式

Input begins with a line containing an integer: N (1N100000) representing the number of available lands. The next N lines each contains two integers: Li Wi (1Li,Wi109) representing the size of the land.

输出格式

Output in a line a number representing the largest building that ICPC Jakarta can build with exactly one decimal point (see sample input/output for clarity).

样例输入

2
5 5
3 4

样例输出

12.5

提示

零基础的同学可以先学习基础,教程见:  C语言教程C++教程编译器教程数据结构教程Python教程单片机教程

视频教学见视频网课

标签

通过率

统 计

 提交 11
 正确 5
 格式错误 0
 答案错误 5
 时间超限 0
 内存超限 0
 输出超限 0
 运行错误 1
 编译错误 0