NyistOJ 8 一种排序(c++)(结构体排序)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#define ll long long
 
using namespace std ;
 
typedef struct{
    int id ;
    int length ;
    int wide ;
}meassage ;
 
bool cmp( meassage a , meassage b ){
    if ( a.id == b.id ){
        if ( a.length == b.length ){
            return a.wide < b.wide ;
        }
        return a.length < b.length ;
    }
    return a.id < b.id ;
}
 
bool check( meassage a , meassage b ){
    if ( a.id == b.id && a.length == b.length && a.wide == b.wide ){
        return true ;
    }
    return false ;
}
 
int main(){
    int t ;
    cin >> t ;
    while ( t -- ){
        int n ;
        cin >> n ;
        meassage mea[n+10] ;
        for ( int i = 0 ; i < n ; i ++ ){
            cin >> mea[i].id >> mea[i].length >> mea[i].wide ;
            if ( mea[i].wide > mea[i].length ){
                swap(mea[i].wide , mea[i].length) ;
            }
        }
        sort( mea , mea + n , cmp ) ;
        printf("%d %d %d\n" , mea[0].id , mea[0].length , mea[0].wide) ;
        for ( int i = 1 ; i < n ; i ++ ){
            if ( !check(mea[i] , mea[i-1]) ){
                printf("%d %d %d\n" , mea[i].id , mea[i].length , mea[i].wide) ;
            }
        }
    }
    return 0 ;
}