题解 | #长方形的关系#

#include<bits/stdc++.h>
using namespace std;
class rectangle {
  private:
    int length, width;
  public:
    void set(int x, int y) {
        length = x;
        width = y;
    }
    int getlength() {
        return length;
    }
    int getwidth() {
        return width;
    }
    int area() {
        return length * width;
    }
    // write your code here......
    int findMax() {
        if (length > width) {
            return length;
        } else {
            return width;
        }
    }
    int findMin() {
        if (length < width) {
            return length;
        } else {
            return width;
        }
    }
    string cancover(rectangle& rec) {
        if (this->area() < rec.area()) {
            return "no";
        } else if (this->findMax() >= rec.findMax() &&
                   this->findMin() >= rec.findMin()) {
            return "yes";
        } else {
            return "no";
        }
    }
};
int main() {
    int l1, w1, l2, w2;
    cin >> l1 >> w1 >> l2 >> w2;
    rectangle a, b;
    a.set(l1, w1);
    b.set(l2, w2);
    cout << a.cancover(b);
    return 0;
}