PAT（甲级）2019年春季考试7-2 Anniversary (25 分)

最新推荐文章于 2022-06-23 17:41:50 发布

感觉自己就是个bug

最新推荐文章于 2022-06-23 17:41:50 发布

阅读量128

点赞数

分类专栏： pat甲级排序

本文链接：https://blog.csdn.net/shshbdhsjjd/article/details/106715567

版权

pat甲级同时被 2 个专栏收录

181 篇文章 1 订阅

订阅专栏

排序

28 篇文章 0 订阅

订阅专栏

7-2 Anniversary (25 分)

Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association （校友会） has gathered the ID’s of all her alumni. Now your job is to write a program to count the number of alumni among all the people who come to the celebration.

Input Specification:

Each input file contains one test case. For each case, the first part is about the information of all the alumni. Given in the first line is a positive integer N (≤10⁵ ). Then N lines follow, each contains an ID number of an alumnus. An ID number is a string of 18 digits or the letter X. It is guaranteed that all the ID’s are distinct.

The next part gives the information of all the people who come to the celebration. Again given in the first line is a positive integer M (≤10⁵ ). Then M lines follow, each contains an ID number of a guest. It is guaranteed that all the ID’s are distinct.

Output Specification:

First print in a line the number of alumni among all the people who come to the celebration. Then in the second line, print the ID of the oldest alumnus – notice that the 7th - 14th digits of the ID gives one’s birth date. If no alumnus comes, output the ID of the oldest guest instead. It is guaranteed that such an alumnus or guest is unique.

Sample Input:

5
372928196906118710
610481197806202213
440684198612150417
13072819571002001X
150702193604190912
6
530125197901260019
150702193604190912
220221196701020034
610481197806202213
440684198612150417
370205198709275042

Sample Output:

3
150702193604190912

#include<bits/stdc++.h>
using namespace std;
int N, M;
vector<string> ans, temp;
unordered_map<string, bool> m;
bool cmp(string a, string b) {
	return a.substr(7, 7) < b.substr(7, 7); 
}
int main() {
	scanf("%d", &N);
	string s;
	for (int i = 0; i < N; i++) {
		cin >> s;
		m[s] = true;
	}
	scanf("%d", &M);
	temp.resize(M);
	for (int i = 0; i < M; i++) {
		cin >> temp[i];
		if (m[temp[i]]) {
			ans.push_back(temp[i]);
		}
	}
	printf("%d\n", ans.size());
	if (ans.size() == 0) {
		sort(temp.begin(), temp.end(), cmp);
		cout << temp[0];
	} else {
		sort(ans.begin(), ans.end(), cmp);
		cout << ans[0];
	}
	
	return 0;
}