Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
3313 | 吴奕希 | 长方形排序 | C++ | Accepted | 10 MS | 276 KB | 751 | 2024-05-05 12:33:03 |
# include<iostream> # include<algorithm> using namespace std; struct Rectangle{ int id, w, h, c; void input(){ cin>>id>>w>>h; if(h>w){ c=h; h=w; w=c; } } void output(){ cout<<id<<" "<<w<<" "<<h<<endl; } bool cmp(Rectangle r2){ return !(id==r2.id&&w==r2.w&&h==r2.h); } }; bool cmp(Rectangle r1, Rectangle r2){ if(r1.id!=r2.id)return r1.id<r2.id; if(r1.w!=r2.w)return r1.w<r2.w; return r1.h<r2.h; } Rectangle r[1000]; int n; int main(){ cin>>n; for(int i = 0; i < n; i++)r[i].input(); sort(r, r+n, cmp); for(int i = 0; i < n; i++)if(i==0||r[i].cmp(r[i-1]))r[i].output(); return 0; }