Educational Round 26 C. Two Seals

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

One very important person has a piece of paper in the form of a rectangle a × b.

Also, he has n seals. Each seal leaves an impression on the paper in the form of a rectangle of the size xi × yi. Each impression must be parallel to the sides of the piece of paper (but seal can be rotated by 90 degrees).

A very important person wants to choose two different seals and put them two impressions. Each of the selected seals puts exactly one impression. Impressions should not overlap (but they can touch sides), and the total area occupied by them should be the largest possible. What is the largest area that can be occupied by two seals?

Input

The first line contains three integer numbers n, a and b (1 ≤ n, a, b ≤ 100).

Each of the next n lines contain two numbers xi, yi (1 ≤ xi, yi ≤ 100).

Output

Print the largest total area that can be occupied by two seals. If you can not select two seals, print 0.

Examples

input

2 2 21 22 1

output

input

4 10 92 31 15 109 11

output

input

3 10 106 67 720 5

output

Note

In the first example you can rotate the second seal by 90 degrees. Then put impression of it right under the impression of the first seal. This will occupy all the piece of paper.

In the second example you can't choose the last seal because it doesn't fit. By choosing the first and the third seals you occupy the largest area.

给你几块印章，让你选出两块，使其盖在纸上时，在不超出纸张大小且必须与长宽平行的条件下，面积最大

In the third example there is no such pair of seals that they both can fit on a piece of paper

 1 #include <iostream>
 2 #include <stdio.h>
 3 using namespace std;
 4 int n, a, b;
 5 int x[120];
 6 int y[120];
 7
 8 int main(){
 9     int ans=0;
10     cin>>n>>a>>b;
11     for(int i=0;i<n;i++)
12         cin>>x[i]>>y[i];
13     for(int i=0;i<n;i++){
14         for(int j=i+1;j<n;j++){
15             for(int it1=0;it1<2;it1++,swap(x[i],y[i])){
16                 for(int it2=0;it2<2;it2++,swap(x[j],y[j])){
17                     if(x[i]+x[j]<=a&&max(y[i],y[j])<=b)
18                         ans=max(x[i]*y[i]+x[j]*y[j],ans);
19                     if(x[i]+x[j]<=b&&max(y[i],y[j])<=a)
20                         ans=max(x[i]*y[i]+x[j]*y[j],ans);
21                 }
22             }
23         }
24     }
25     cout<<ans<<"\n";
26     return 0;
27 }

转载于:https://www.cnblogs.com/z-712/p/7295599.html

Educational Round 26 C. Two Seals相关推荐

[Educational Round 5][Codeforces 616F. Expensive Strings]
这题调得我心疲力竭...Educational Round 5就过一段时间再发了_(:з」∠)_ 先后找了三份AC代码对拍,结果有两份都会在某些数据上出点问题...这场的数据有点水啊_(:з」∠)_[ ...
Codeforces Educational Round 5
Codeforces Educational Round 5 通过数: 4 Standing: 196/4176 题目链接: http://codeforces.com/contest/616 A: ...
educational round 前缀和_总结分析634个以re为前缀的单词得出了re为前缀组合单词意思规律
学英语需要有耐心.恒心!本文稍长!本文的目的所在是让读者在一篇文章里可以理解634个re前缀的单词,更重要的是可以复习到对应的634个常见的基础单词. 看下面的动图,小球从高点回到底部,从底部回到高点 ...
CodeForces616:Educational Round 5
文章目录前言 A Comparing Two Long Integers\text{A Comparing Two Long Integers}A Comparing Two Long Intege ...
Educational Round 66 题解
作为橙名来水了一发-- 这次题目就比上次良心多了.7题有5题会做. 然而风格仍然很怪异--还是练少了? A 水题.不过一开始没注意细节挂了几发,罚时罚的真痛-- 明显是能除以 $k$ 就除以 $k$, ...
Codeforces Educational round 58
Ediv2 58 随手AK.jpg D 裸的虚树,在这里就不写了 E 傻逼贪心?这个题过的比$B$都多.jpg #include <cstdio> #include <algorit ...
CF Educational Round 23 F.MEX Queries
写了3小时 = =.这两天堕落了,昨天也刷了一晚上hihocoder比赛,还爆了零.之后得节制点了,好好准备考研.. 首先很容易想到压缩数据 + 线段树然后对于Pushdown真很难写..需要牵涉 ...
Educational Round 64 题解
前言: 这场太难了--我一个紫名只打出两题--(虽说感觉的确发挥不够好) 一群蓝绿名的dalao好像只打了两题都能升分的样子-- 庆幸的是最后A出锅然后unr了>///< 写一波题解纪念这 ...
[BC Round#26] Card 【各种水】
题目链接:HDOJ - 5159 这道题的做法太多了..BC的第二题也是可以非常水的.. 算法一我在比赛的时候写的算法是这样的.. 预处理出所有的答案,然后对于每个询问直接输出. 询问 (a, b) ...

Educational Round 26 C. Two Seals

Educational Round 26 C. Two Seals相关推荐

最新文章

热门文章