1047 Student List for Course (25分)

Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤40,000), the total number of students, and K (≤2,500), the total number of courses. Then N lines follow, each contains a student's name (3 capital English letters plus a one-digit number), a positive number C (≤20) which is the number of courses that this student has registered, and then followed by C course numbers. For the sake of simplicity, the courses are numbered from 1 to K.

Output Specification:

For each test case, print the student name lists of all the courses in increasing order of the course numbers. For each course, first print in one line the course number and the number of registered students, separated by a space. Then output the students' names in alphabetical order. Each name occupies a line.

Sample Input:

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

Sample Output:

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

 https://blog.csdn.net/muAluo/article/details/108261122姊妹篇，题目不难，就是卡时间点。

没有弄明白为什么我用set被卡但是用vector自己排序不会卡。

代码如下：

#include<iostream> #include<vector> #include<algorithm> using namespace std; int main(){ int N,M; scanf("%d%d",&N,&M); vector<string> stu_course[2501]; for(int i = 1 ; i <= N ; i ++){ string name; int K,course; name.resize(4);//!!! scanf("%s %d",&name[0],&K); while(K--){ scanf("%d",&course); stu_course[course].push_back(name); } } for(int i = 1 ; i <= M ; i ++){ sort(stu_course[i].begin(),stu_course[i].end()); printf("%d %d\n",i,stu_course[i].size()); for(int j = 0 ; j < stu_course[i].size() ; j ++) printf("%s\n",stu_course[i][j].c_str()); } return 0; }