Student List for Course

调了好久，最后一个点一直超时，借鉴了下别人的。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <string>
#include <cstring>

using namespace std;
const int MAXN = 40010;


vector<int> v[MAXN];
int change(char name[]){
    int sum = 0;
    for (int i=2; i>=0; i--) {
        sum = sum*26 + (name[i]-'A');
    }
    sum = sum*10 + (name[3]-'0');
    return sum;
}
char name[MAXN][5];
bool cmp(int a,int b){
    return strcmp(name[a], name[b]) < 0;
}

int main(){
    int N,K; // 总人数，总课程
//    printf("123\n");
    scanf("%d%d",&N,&K);
    for (int i=0; i<N; i++) {
        
        scanf("%s",name[i]);
        int number;
        scanf("%d",&number);
        for (int j=0; j<number; j++) {
            int course;
            scanf("%d",&course);
            v[course].push_back(i);
        }
    }
    for (int i=1; i<=K; i++) {
        sort(v[i].begin(), v[i].end(),cmp);
        printf("%d %d\n",i,v[i].size());
        for(int j=0;j<v[i].size();j++){
            printf("%s\n",name[v[i][j]]);
//            std::cout << name[v[i][j]] << endl;
        }
    }
    
    
    
}