A1157 Anniversary（25分）PAT甲级 (Advanced Level) Practice（C++）满分题解【字符串+排序】

最新推荐文章于 2022-08-08 10:23:35 发布

烧烤大团子

最新推荐文章于 2022-08-08 10:23:35 发布

阅读量677

点赞数

分类专栏： # PAT 文章标签： c++ 算法经验分享数据结构

本文链接：https://blog.csdn.net/qq_47677800/article/details/125108919

版权

PAT 专栏收录该内容

91 篇文章 1 订阅

订阅专栏

这是一个关于程序设计的实例，主要任务是统计参加校友会庆典的校友人数，并找出其中最年长的校友ID。输入包括两部分：校友信息和参加庆典的人员信息，所有ID都是唯一的。程序通过比较出生日期来确定最年长者。给定的代码实现了这个功能，首先读取校友和参加者的ID，然后对参加者进行排序并检查是否为校友，最后输出校友数量和最年长校友ID。

摘要由CSDN通过智能技术生成

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 (≤105). 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 (≤105). 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<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
bool cmp(string a,string b)
{
    string a1=a.substr(6,8);
    string b1=b.substr(6,8);
    return a1<b1;
}
int main()
{
    int n,m;
    cin>>n;
    map<string,int> alumnus;
    map<string,int> guest;
    vector<string> v;
    for(int i=1;i<=n;i++){
        string id;
        cin>>id;
        alumnus[id]=1;
    }
    cin>>m;
    for(int i=1;i<=m;i++){
        string id;
        cin>>id;
        v.push_back(id);
        guest[id]=1;//来了典礼的
    }
    sort(v.begin(),v.end(),cmp);
    int cnt=0,flag=0,oldest;
    for(int i=0;i<v.size();i++)
    {
        if(alumnus[v[i]]==1){
            if(flag==0){
                cnt++;
                flag=1;
                oldest=i;
            }
            else cnt++;
        }
    }
    cout<<cnt<<endl;
    if(cnt==0)cout<<v[0]<<endl;
    else cout<<v[oldest]<<endl;
    return 0;
}