题解（用sort)

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