PAT 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

分析：
1、课程是用编号，则不需要用map，数组就可以解决；刚开始用的set，最后一个测试点运行超时；最后换成vector+sort，则通过

2、set和vector+sort的复杂度分析

（学生数n，课程数k）

set的复杂度
set用到的操作insert;
set的insert()复杂度为logn（n是当前大小），最坏情况下每门课程插入n个学生的名字，用时log1 + log2 + log3 + …… logn = log(n!) = O(nlogn)，k门课就是O(knlogn);
set遍历操作++，–复杂度均为O(logn)，输出O(knlogn)

vector的+sort复杂度
vector的push_back复杂度O(kn) ( 远低于O(knlogn) )
sort()复杂度O(knlogn)，输出为O(kn)

则vector+sort更高效
（感谢zhang35大佬解析）

我的代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2510;
vector<string> s[maxn];
int main()
{
    int n,k,c;
    scanf("%d%d",&n,&k);
    for (int i = 0 ;i < n ;i++)
    {
        string name;
        cin >> name >> c;
        for (int j = 0 ;j < c ;j++)
        {
            int k;
            scanf("%d",&k);
            s[k].push_back(name);
        }
    }
    for (int i = 1 ;i <= k ;i++)
    {
        printf("%d %d\n",i,s[i].size());
        sort(s[i].begin(),s[i].end());
        for (auto it = s[i].begin() ;it != s[i].end() ;it++)
            printf("%s\n",(*it).c_str());
    }
    return 0;
}