PAT甲级 1047 Student List for Course (25分) (模拟)

题目链接:传送门

思路:直接存储字符串模拟即可。

代码:

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3005;

vector <string> g[maxn]; 

int main() {
	int n , k;
	ios::sync_with_stdio(0);
	cin >> n >> k;
	for(int i = 0 ; i < n ; i++) {
		string s;
		cin >> s;
		int t;
		cin >> t;
		while(t--) {
			int num;
			cin >> num;
			g[num].push_back(s);
		}
	}
	for(int i = 1 ; i <= k ; i++) {
		sort(g[i].begin() , g[i].end());
		cout << i << " " << g[i].size() << "\n";
		for(int j = 0 ; j < g[i].size() ; j++) {
			cout << g[i][j] << "\n";
		}
	}
	return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_39475280/article/details/103424973