习题3-10盒子 UVa1587

对重载运算符的应用
题目：https://vjudge.net/problem/UVA-1587

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;

struct Box{
    int w;
    int h;
    Box(){w=0,h=0;}
    Box(int a,int b){w=min(a,b),h=max(a,b);}
    bool operator < (Box a){return w!=a.w?w<a.w:h<a.h;}
    bool operator == (Box a){return w==a.w&&h==a.h;}
}box[6];

int main(){
    int w,h;
    while(scanf("%d%d",&w,&h)==2){
        box[0]=Box(w,h);
        for(int i=1;i<6;i++){
            scanf("%d%d",&w,&h);
            box[i]=Box(w,h);
        }
        sort(box,box+6);
         bool lhs=box[0]==box[1]&&box[2]==box[3]&&box[4]==box[5];
        bool rhs=box[0].w==box[2].w&&box[0].h==box[4].w&&box[2].h==box[4].h;
         printf("%s\n",lhs&&rhs?"POSSIBLE":"IMPOSSIBLE");
    }
    return 0;
}