文章标题 Gym100791G：repair

repair

Alex is repairing his country house. He has a rectangular metal sheet of size a × b. He has to cut two rectangular sheets of sizes a1 × b1 and a2 × b2 from it. All cuts must be parallel to the sides of the initial sheet. Determine if he can do it.

Input
The first line contains two space-separated integers a and b (1 ≤ a, b ≤ 109) — the sizes of the initial sheet.

The second line contains two space-separated integers a1 and b1 (1 ≤ a1, b1 ≤ 109) — the sizes of the first sheet to cut out.

The third line contains two space-separated integers a2 and b2 (1 ≤ a2, b2 ≤ 109) — the sizes of the second sheet to cut out.

Output
Output «YES» (without quotes), if it’s possible to cut two described sheets from the initial sheet, or «NO» (without quotes), if it’s not possible.

Examples
input
12 20
14 7
5 6
output
YES
input
12 20
11 9
20 7
output
NO
题意：有一个a*b的矩形，现想在这个矩形中截出两个矩形，长度分别为a1*b1,a2*b2。问能否在大矩形中截出来。
分析：直接把所有可能的情况列出来。。。水题。。
代码

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<math.h>
#include<map>
#include<queue> 
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
int main ()
{
    long long a,b;
    while (scanf ("%lld%lld",&a,&b)!=EOF){
        long long a1,b1,a2,b2;
        scanf ("%lld%lld",&a1,&b1);
        scanf ("%lld%lld",&a2,&b2);
        if ((a1+a2<=a&&max(b1,b2)<=b)||(a1+a2<=b&&max(b1,b2)<=a)){
            printf ("YES\n");
        }
        else if ((a1+b2<=a&&max(a2,b1)<=b)||(a1+b2<=b&&max(a2,b1)<=a)){
            printf ("YES\n");
        }
        else if ((a2+b1<=a&&max(a1,b2)<=b)||(a2+b1<=b&&max(a1,b2)<=a)){
            printf ("YES\n");
        }
        else if ((b1+b2<=a&&max(a1,a2)<=b)||(b2+b1<=b&&max(a1,a2)<=a)){
            printf ("YES\n");
        }
        else printf ("NO\n");
    }
    return 0;
}