| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 133374 | 罗迎甲 | 朋友信息 | C++ | Wrong Answer | 1 MS | 268 KB | 541 | 2025-10-18 16:21:18 |
#include<bits/stdc++.h> using namespace std; struct fd{ string nama; int birth; string n1; }f[20]; bool cmp(fd x,fd y){ if(x.birth!=y.birth) return x.birth<y.birth; else if(x.nama!=y.nama) return x.nama<y.nama; else return x.n1<y.n1; } int main(){ int n; cin>>n; for(int i=0;i<n;i++) cin>>f[i].nama>>f[i].birth>>f[i].n1; sort(f+0,f+n,cmp); for(int i=0;i<n;i++) cout<<f[i].nama<<f[i].birth<<f[i].n1<<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-----
Joy1999030218792049590 lele1999030213685930581 lema1999030213592039485 Kity200109121872749501