1047. Student List for Course (25)

#include<iostream>
#include<algorithm>
#include<vector>
#include<map> 
#include<string>
#include<set>
using namespace std;
const int K = 2501;
vector<int> cous[K];
int main(){
	int n, k;
	cin>>n>>k;
	for(int i = 0; i < n; i++){
		char a1, a2, a3;
		int c, a4;
		getchar();//空格 
		scanf("%c%c%c%d%d",&a1,&a2,&a3,&a4,&c);
		int temp = (a1 - 'A') * 26 * 26 * 10 + (a2 - 'A') * 26 * 10 + (a3 - 'A') * 10 + a4;
		for(int j = 0; j < c; j++){
			int tempcou;
			scanf("%d",&tempcou);
			cous[tempcou].push_back(temp);
		}
	}
	for(int i = 1; i <= k; i++){
		sort(cous[i].begin(),cous[i].end());
		printf("%d %d\n",i,cous[i].size());
		for(int j = 0; j < cous[i].size(); j++){
			int name = cous[i][j];
			printf("%c%c%c%d\n",name/10/26/26+'A',name/10/26%26+'A',name/10%26+'A',name%10);
		}
	}
	return 0;
}