传送门

求助神犇

蒟蒻代码见下：

#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
#include<cstdlib>
using namespace std;
struct sr{
	char s[25];
	int x,y,z,num;
} a[105];
int n;
bool cmp(sr c,sr b)
{
	return (c.x<b.x)||(c.x==b.x&&c.y<b.y)||(c.x==b.x&&c.y==b.y&&c.z<b.z)||(c.x==b.x&&c.y==b.y&&c.z==b.z&&c.num<b.num);
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%s %d%d%d",&a[i].s,&a[i].x,&a[i].y,&a[i].z);
		a[i].num=i;
	}
	stable_sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
		printf("%s\n",a[i].s);
	return 0;
}