Amy 8.999999999999999999999999999999999999999990000

Bob 8.9999999999999999999999999999999999999999800

Cat 8.9999999999999999999999999999999999999999899999999

沃老师并不会告诉大家分数的排名，但学生间竞争激烈，大家都想知道自己的作文成绩在班上的排名。

#define ll long long

const int maxn = 2e5+5;

const int mod = 1e9+7;

const double eps = 1e-9;

const double pi = acos(-1.0);

const int inf = 0x3f3f3f3f;

struct node

{

    string name;

    string score;

    string ss;

    //bool operator< (const node &v)const{

        //if (ss == v.ss) return name < v.name;

        //return ss > v.ss;

    //}

}pre[maxn];

bool cmp(node &a, node &b){

    if (a.ss == b.ss) return a.name < b.name;

    return a.ss > b.ss;

}

int main() {

    //freopen("in.txt", "r", stdin);

    //freopen("out.txt", "w", stdout);

    ios::sync_with_stdio(false);

    int n;

    cin >>n;

    for(int i = 1; i <= n; i++){

        //scanf("%s%s", pre[i].name, pre[i].score);

        cin >> pre[i].name >> pre[i].score;

        int len = pre[i].score.size()-1;

        while(pre[i].score[len] == '0') len--;

        pre[i].ss = pre[i].score.substr(0, len+1);

    }

    sort(pre+1, pre+1+n, cmp);

    for(int i = 1; i <= n; i++){

        cout << pre[i].name << " " << pre[i].score << endl;

    }

    return 0;

}