PAT | A1039 Course List for Student

#include <iostream>
#include <string>
#include <map>
#include <set>

using namespace std;

map<string,set<int> > students;

int main(){
	int numOfQueries,numOfCourses;
	scanf("%d %d",&numOfQueries,&numOfCourses);
	for(int i = 0;i < numOfCourses;i++){
		int coursesId,studentsNum;
		scanf("%d %d",&coursesId,&studentsNum);
		for(int j = 0;j < studentsNum;j++){
			string student;
			student.resize(5);
			scanf("%s",&student[0]);
			students[student].insert(coursesId);
		}
	}
	for(int i = 0;i < numOfQueries;i++){
		string student;
		student.resize(5);
		scanf("%s",&student[0]);
		if(students.find(student) != students.end()){//如果能找到这个学生
			printf("%s %d ",student.c_str(),students[student].size());
			set<int>::iterator it = students[student].begin();
			for( ;it != --students[student].end();it++){
				printf("%d ",*it);
			}
			printf("%d\n",*it);
		}
		else{
			printf("%s ",student.c_str());
			printf("0\n");
		}
	}
	system("pause");
	return 0;
}