PAT a1022题解

最新推荐文章于 2021-09-26 20:01:41 发布

a18779148177

最新推荐文章于 2021-09-26 20:01:41 发布

阅读量295

点赞数 1

分类专栏： c/c++ oj 数据结构和算法文章标签： PAT cc++ 编程语言程序设计 oj

本文链接：https://blog.csdn.net/a18779148177/article/details/75269598

版权

c/c++ 同时被 3 个专栏收录

122 篇文章 0 订阅

订阅专栏

数据结构和算法

120 篇文章 0 订阅

订阅专栏

109 篇文章 0 订阅

订阅专栏

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

using namespace std;

map<string, set<int> > mpTitle, mpAuthor, mpKey, mpPub, mpYear;

void query(map<string, set<int> >& mp, string& str){
	if(mp.find(str) == mp.end()) printf("Not Found\n");
	else{
		for(set<int>::iterator it = mp[str].begin(); it != mp[str].end(); it++){
			printf("%07d\n", *it);
		}
	}
}

int main(){
	int n, m, id, type;
	string title, author, key, pub, year;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &id);
		char c = getchar();
		getline(cin, title);
		mpTitle[title].insert(id);
		getline(cin, author);
		mpAuthor[author].insert(id);
		while(cin >> key){
			mpKey[key].insert(id);
			c = getchar();
			if(c == '\n') break;
		}
		getline(cin, pub);
		mpPub[pub].insert(id);
		getline(cin, year);
		mpYear[year].insert(id);
	}
	string temp;
	scanf("%d", &m);
	for(int i = 0; i < m; i++){
		scanf("%d: ", &type);
		getline(cin, temp);
		cout << type << ": " << temp << endl;
		if(type == 1) query(mpTitle, temp);
		else if(type == 2) query(mpAuthor, temp);
		else if(type == 3) query(mpKey, temp);
		else if(type == 4) query(mpPub, temp);
		else query(mpYear, temp);
	}
	return 0;
}