教你用最放心的方法解

#include<bits/stdc++.h>
using namespace std;
struct node{
    string name;
    int id,score;
}a[105];
bool cmp(node a,node b){return a.id < b.id;}
int main(){
    int n; cin >> n;
    for(int i = 1;i <= n;i++){
        string t; cin >> t >> a[i].name >> a[i].score;
        a[i].id = stoi(t);
    }
    sort(a + 1,a + n + 1,cmp);
    for(int i = 1;i <= n;i++) cout << a[i].score << "\n";
    return 0;
}