PAT A 1028 List Sorting

#include<iostream>
#include<algorithm>
#include<vector>
#include<string.h>
using namespace std;

struct STU{
    char id[10],name[10];
    int grade;
};

bool cmp1(STU a,STU b)
{
    return strcmp(a.id,b.id)<0;
}

bool cmp2(STU a,STU b)
{
    if(strcmp(a.name,b.name)!=0)      return strcmp(a.name,b.name)<0;
    else                               return strcmp(a.id,b.id)<0;
}

bool cmp3(STU a,STU b)
{
    if(a.grade!=b.grade)    return a.grade<b.grade;
    else                    return strcmp(a.id,b.id)<0;
}

int main()
{
    int n,c,i;
    cin>>n>>c;
    STU stu[n];
    for(i=0;i<n;i++){
        scanf("%s%s%d",stu[i].id,stu[i].name,&stu[i].grade);
    }
    switch(c){
        case 1:sort(stu,stu+n,cmp1);break;
        case 2:sort(stu,stu+n,cmp2);break;
        case 3:sort(stu,stu+n,cmp3);break;
    }
    for(i=0;i<n;i++){
        printf("%s %s %d\n",stu[i].id,stu[i].name,stu[i].grade);
    }
    return 0;
}

id name 用sting 输入输出用cin cout的话最后一个测试点会超时