Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
39904 | 朱启睿 | 朋友信息 | C++ | Accepted | 1 MS | 272 KB | 719 | 2022-10-05 15:12:42 |
#include<bits/stdc++.h> using namespace std; struct f_riend{ string name; int birthday; long long phone_number; }; bool cmp(f_riend a,f_riend b){ if(a.birthday!=b.birthday){ return a.birthday <b.birthday; } if(a.birthday==b.birthday&&a.name!=b.name){ return a.name< b.name; } if(a.birthday==b.birthday&&a.name==b.name&&a.phone_number!=b.phone_number){ return a.phone_number<b.phone_number; } } int main (){ int n; cin >> n; f_riend a[n]; for(int i=0;i<n;i++){ cin >> a[i].name >> a[i].birthday >> a[i].phone_number; } sort(a+0,a+n,cmp); for(int i=0;i<n;i++){ cout << a[i].name << " " << a[i].birthday << " " << a[i].phone_number << endl; } return 0; }