PAT-2019年春季考试-甲级-Anniversary

Anniversary
作者: 陈越
单位: 浙江大学
时间限制: 800 ms
内存限制: 64 MB
代码长度限制: 16 KB
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 (≤1e5). 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 (≤1e​5 ). 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

考点：字符串处理
题意：先用map记录一下所有的alumni，在遍历guest的时候判断alumni是否出现过(即在map中出现)，输出生日最小的人。
如果为空输出guest中出生日期最小的。

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
map<string,int> mp;
string stk1[N],stk2[N],stk3[N];
int cnt=0;
bool cmp(string &a,string &b)
{
    string aa=a.substr(6,8);
    string bb=b.substr(6,8);
    return aa<bb;
}
int main()
{
    int n,m; scanf("%d",&n);
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        mp[s]=1;
        stk1[i]=s;
    }
    int ans=0;
    scanf("%d",&m);
    for(int i=1;i<=m;i++){
        string s;cin>>s;
        if(mp[s]) ans++,stk3[++cnt]=s;
        stk2[i]=s;
    }
    printf("%d\n",ans);
    sort(stk1+1,stk1+1+n,cmp);
    sort(stk2+1,stk2+1+m,cmp);
    sort(stk3+1,stk3+1+cnt,cmp);
    if(ans){
        cout<<stk3[1]<<endl;
    }else{
        cout<<stk2[1]<<endl;
    }
    return 0;
}