跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1707. Group Photo 2 (online mirror version)

  • ID: 1713
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 枚举
  • 贪心
  • 排序
  • 算法思想
  • 编程与模拟
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Group Photo 2 (online mirror version)

题目描述

B. Group Photo 2 (online mirror version)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Many years have passed, and n friends met at a party again. Technologies have leaped forward since the last meeting, cameras with timer appeared and now it is not obligatory for one of the friends to stand with a camera, and, thus, being absent on the photo.

Simply speaking, the process of photographing can be described as follows. Each friend occupies a rectangle of pixels on the photo: the i-th of them in a standing state occupies a wi pixels wide and a hi pixels high rectangle. But also, each person can lie down for the photo, and then he will occupy a hi pixels wide and a wi pixels high rectangle.

The total photo will have size W×H, where W is the total width of all the people rectangles, and H is the maximum of the heights. The friends want to determine what minimum area the group photo can they obtain if no more than n/2 of them can lie on the ground (it would be strange if more than n/2 gentlemen lie on the ground together, isn't it?..)

Help them to achieve this goal.

Input

The first line contains integer n (1≤n≤1000) − the number of friends.

The next n lines have two integers wi,hi (1≤wi,hi≤1000) each, representing the size of the rectangle, corresponding to the i-th friend.

Output

Print a single integer equal to the minimum possible area of the photo containing all friends if no more than n/2 of them can lie on the ground.

Examples
Input
3
10 1
20 2
30 3
Output
180
Input
3
3 1
2 2
4 3
Output
21
Input
1
5 10
Output
50

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1251 题。保留原作者与原赛事署名。