Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
99 | 关清声 | 朋友信息 | C++ | Wrong Answer | 0 MS | 268 KB | 705 | 2022-07-19 10:15:05 |
#include<iostream> #include<cstring> #include<algorithm> using namespace std; struct fri { string name; int bir; long long phone; }a[10]; bool cmp(fri x,fri y) { if(x.bir!=y.bir) { return x.bir>y.bir; } else { if(x.name!=y.name) { return x.name<y.name; } else { return x.phone<y.phone; } } } int main() { int n; cin>>n; for(int i=0;i<n;i++) { cin>>a[i].name>>a[i].bir>>a[i].phone; } sort(a,a+n,cmp); for(int i=0;i<n;i++) { cout<<a[i].name<<" "<<a[i].bir<<" "<<a[i].phone<<endl; } return 0; }
------Input------
4 lele 19990302 13685930581 lema 19990302 13592039485 Kity 20010912 1872749501 Joy 19990302 18792049590
------Answer-----
Joy 19990302 18792049590 lele 19990302 13685930581 lema 19990302 13592039485 Kity 20010912 1872749501
------Your output-----
Kity 20010912 1872749501 Joy 19990302 18792049590 lele 19990302 13685930581 lema 19990302 13592039485