1s，16MiB

WA Code：

#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<map>
using namespace std;
struct st{
	long long num;
	string s;
	long long mark;
}a[10001];
long long n;
bool cmp(st x,st y){
	return x.mark>y.mark;
}
int main(){
	cin>>n;
	for(long long i=1;i<=n;i++){
		cin>>a[i].num;
		cin>>a[i].s;
		cin>>a[i].mark;
	}
	sort(a+1,a+n+1,cmp);
	for(long long i=1;i<=n;i++){
		cout<<a[i].num<<" ";
		cout<<a[i].s<<" ";
		cout<<a[i].mark<<endl;
	}
	return 0;
}