提交时间:2025-05-05 20:59:24

运行 ID: 320548

#include<bits/stdc++.h> using namespace std; struct Ks{ int fenshu,yongshi,hao; }; bool cmp(Ks x,Ks y){ if(x.fenshu!=y.fenshu) return x.fenshu>y.fenshu; if(x.yongshi!=y.yongshi) return x.yongshi<y.yongshi; return x.hao<y.hao; } int main(){ int n; Ks s[1010]; cin>>n; for(int i=1;i<=n;i++){ cin>>s[i].fenshu; cin>>s[i].yongshi; cin>>s[i].hao; } sort(s+1,s+n+1,cmp); for(int i=1;i<=n;i++){ cout<<s[i].fenshu<<" "; cout<<s[i].yongshi<<" "; cout<<s[i].hao<<endl; } return 0; }