A1028（25）

段错误可能是数组开小了
本题没有太大的难度

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn=100010;
struct node
{
	int id;
	char name[10];
	int score;
}a[maxn];
bool cmp1(node b,node c)
{
	return b.id<c.id;
}
bool cmp2(node b,node c)
{
	if (strcmp(b.name,c.name)!=0)
	return strcmp(b.name,c.name)<0;
	else return b.id<c.id;
}
bool cmp3(node b,node c)
{
	if (b.score!=c.score)
	return b.score<c.score;
	else return b.id<c.id;
}
int main()
{
	int n,m;
	cin>>n>>m;
	for (int i=0;i<n;i++)
	{
		scanf("%d %s %d",&a[i].id,a[i].name,&a[i].score);
	}
	if (m==1)
	sort(a,a+n,cmp1);
	else if(m==2)
	sort(a,a+n,cmp2);
	else if(m==3)
	sort(a,a+n,cmp3);
	for (int i=0;i<n;i++)
	{
		printf("%06d %s %d\n",a[i].id,a[i].name,a[i].score);
	}
}