Run ID:37391

提交时间:2022-08-20 09:30:58

#include<iostream> #include<algorithm> using namespace std; struct node{ string name; int sum; }a[25]; bool cmp(node x,node y){ if(x.sum!=y.sum)return x.sum>y.sum; return x.name<y.name; } int main() { int n; cin>>n; for(int i=1;i<=n;++i)cin>>a[i].name>>a[i].sum; sort (a+1,a+1+n,cmp); for(int i=1;i<=n;++i){ cout<<a[i].name<<" "<<a[i].sum<<endl; } return 0; }