#include<iostream> #include<algorithm> using namespace std; struct student{ string name; int t; }; bool cmp(student a,student b){ if(a.t != b.t){ return a.t>b.t; } if(a.name != b.name){ return a.name<b.name; } } int main(){ int n; cin>>n; student a[n]; for(int i=0;i<n;i++){ cin>>a[i].name>>a[i].t; } sort(a+0,a+n,cmp); for(int j=0;j<n;j++){ cout<<a[j].name<<' '<<a[j].t<<endl; } return 0; }