打印选课学生名单

<p>假设全校有最多40000名学生和最多2500门课程。现给出每个学生的选课清单，要求输出每门课的选课学生名单。</p><h3 id="-">输入格式:</h3><p>输入的第一行是两个正整数：N（<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mo>≤</mo></mrow><annotation encoding="application/x-tex">\le</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="strut" style="height: 0.63em;"></span><span class="strut bottom" style="height: 0.77em; vertical-align: -0.13em;"></span><span class="base textstyle uncramped"><span class="mrel">≤</span></span></span></span>40000），为全校学生总数；K（<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mo>≤</mo></mrow><annotation encoding="application/x-tex">\le</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="strut" style="height: 0.63em;"></span><span class="strut bottom" style="height: 0.77em; vertical-align: -0.13em;"></span><span class="base textstyle uncramped"><span class="mrel">≤</span></span></span></span>2500），为总课程数。此后N行，每行包括一个学生姓名（3个大写英文字母+1位数字）、一个正整数C（<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mo>≤</mo></mrow><annotation encoding="application/x-tex">\le</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="strut" style="height: 0.63em;"></span><span class="strut bottom" style="height: 0.77em; vertical-align: -0.13em;"></span><span class="base textstyle uncramped"><span class="mrel">≤</span></span></span></span>20）代表该生所选的课程门数、随后是C个课程编号。简单起见，课程从1到K编号。</p><h3 id="-">输出格式:</h3><p>顺序输出课程1到K的选课学生名单。格式为：对每一门课，首先在一行中输出课程编号和选课学生总数（之间用空格分隔），之后在第二行按字典序输出学生名单，每个学生名字占一行。</p><h3 id="-">输入样例:</h3><pre><code>10 5
ZOE1 2 4 5
ANN0 3 5 2 1
BOB5 5 3 4 2 1 5
JOE4 1 2
JAY9 4 1 2 5 4
FRA8 3 4 2 5
DON2 2 4 5
AMY7 1 5
KAT3 3 5 4 2
LOR6 4 2 4 1 5
</code>

输出样例:

1 4
ANN0
BOB5
JAY9
LOR6
2 7
ANN0
BOB5
FRA8
JAY9
JOE4
KAT3
LOR6
3 1
BOB5
4 7
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1
5 9
AMY7
ANN0
BOB5
DON2
FRA8
JAY9
KAT3
LOR6
ZOE1

#include <stdio.h>
#include <string>
#include <math.h>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int name_change(char name[5]){
	return (name[0]-'A')*26*260+(name[1]-'A')*260+(name[2]-'A')*10+(name[3]-'0');
}
void p(int namet){
	int a,b,c,d;
	a=namet/6760;
	b=(namet%6760)/260;
	c=namet%260/10;
	d=namet%10;
	printf("%c%c%c%c\n", a+'A', b+'A', c+'A', d+'0' ); 
}
int main(void)
{
	int n,k,cla,num;
	char name_temp[5];
	int namet;
	scanf("%d %d",&n,&k);
	vector<int> *class_name=new vector<int>[k+1];
	vector<int>::iterator it;
	for (int i=0;i<n;i++){
		scanf("%s %d",name_temp,&num);
		namet=name_change(name_temp);
		for (int j=0;j<num;j++){
			scanf("%d",&cla);
			class_name[cla].push_back(namet);
		}
	}
	for (int i=1;i<=k;i++){
		printf("%d %d\n",i,class_name[i].size());
		sort(class_name[i].begin(),class_name[i].end());
		for (int j=0;j<class_name[i].size();j++){
			p(class_name[i][j]);
		}
	}
	return 0;
}