Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
3331 邓程允 朋友信息 C++ Wrong Answer 0 MS 268 KB 603 2024-05-18 11:08:26

Tests(0/3):


Code:

# include<iostream> # include<algorithm> using namespace std; struct Friend{ string name; int bir; int phone; }; Friend s[101]; bool cmp(Friend a,Friend b){ if(a.bir!=a.bir)return a.bir>b.bir; if(a.bir==b.bir && a.name>b.name)return a.name>b.name; if(a.bir==b.bir && a.name==b.name)return a.phone<b.phone; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>s[i].name>>s[i].bir>>s[i].phone; } sort(s,s+n,cmp); for(int i=1;i<=n;i++){ cout<<s[i].name<<" "<<s[i].bir<<" "<<s[i].phone<<endl; } return 0; }


Run Info:

------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-----
0 0 0 0 lele 19990302 2147483647 0 0