1039. Course List for Student (25)

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> v[270000];

int getbigindex(char s[])
{
	return (s[0] - 'A') * 26 * 26 * 10 + (s[1] - 'A') * 26 * 10 + (s[2] - 'A') * 10 + s[3] - '0';
}

int main()
{
	int n, k;
	scanf("%d%d", &n, &k);

	int i, c, ci, j, bigindex;
	char name[5];

	for(i = 1; i <= k; i++)
	{
		scanf("%d%d", &c, &ci);

		for(j = 1; j <= ci; j++)
		{
			getchar();
			scanf("%s", name);

			bigindex = getbigindex(name);
			v[bigindex].push_back(c);
		}
	}

	int size;
	for(i = 1; i <= n; i++)
	{
		getchar();
		scanf("%s", name);
		printf("%s", name);

		bigindex = getbigindex(name);
		size = v[bigindex].size();
		printf(" %d", size);
		
		if(size > 0)
		{
			sort(v[bigindex].begin(), v[bigindex].end());

			for(j = 0; j <= size - 1; j++)
			{
				printf(" %d", v[bigindex][j]);
			}
		}

		printf("\n");
	}

	system("pause");
	return 0;
}