1445 - Pku3245 Sequence Partitioning

输入

输出

样例

输入

4 6
4 3
3 5
2 5
2 4

输出

9

提示

An available assignment is the first two pairs are assigned into the first part and the last two pairs are assigned into the second part. Then B1 > A3, B1 > A4, B2 > A3, B2 > A4, max{A1, A2}+max{A3, A4} ≤ 6, and minimum max{B1+B2, B3+B4}=9.

时间限制 1 秒
内存限制 128 MB
讨论 统计
上一题 下一题