19年春季第二题 PAT甲级 1157 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 NNN (≤105).
Then NNN 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 MMM(≤105). Then MMM 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

3
150702193604190912

说真的，不难。就是个排序题，优先将学生排在前面，然后再是按照年龄排，年龄大的数字小，如果学生为0也要输出0

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 200005;
struct node{
	string id;
	bool isStu;
}person[maxn];

bool cmp(node a, node b){
	if(a.isStu != b.isStu) return a.isStu > b.isStu;//bool就是01
	else return a.id.substr(6,8) < b.id.substr(6,8); 
}

int main(){
	int n;
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>person[i].id;
		person[i].isStu = true;
	}
	int m;
	cin>>m;
	for(int i = n; i < n + m; i++){
		cin>>person[i].id;
		person[i].isStu = false;
	}
	int cnt = 0;
	for(int i = 0; i < n + m; i++){
		if(person[i].isStu == true) cnt++;
	}
	sort(person,person+m+n,cmp);
	cout<<cnt;
	cout<<endl<<person[0].id;
	return 0;
}

这题目有问题的，反正找有没有用unordered_set和unordered_map准没错

//法一：排序，学生设为1，其余设为0，学生排前面，然后按照年龄排
//法二：用map记录下学生，输入客人时判断是否是学生，如果是cnt++；最后遍历客人数组，如果cnt>0,则比较出年龄最大的学生，如果cnt为0，就比较所有人里面年龄最大的
//法三：用unordered_set记录每个学生，遍历guest，然后看是否能find到学生，find的 
#include<iostream>
#include<unordered_map>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 100005;
struct node{
	bool stu = false;
	string id;
}person[maxn];
unordered_map<string,int> ma;

bool cmp(node a, node b){
	if(a.stu != b.stu) return a.stu>b.stu;
	else return a.id.substr(6,8) < b.id.substr(6,8);
}

int main(){
	int n;
	cin>>n;
	string id;
	for(int i = 0; i < n; i++){
		cin>>id;
		ma[id]++;
	}
	int m;
	cin>>m;
	int cnt = 0;
	for(int i = 0; i < m; i++){
		cin>>person[i].id;
		if(ma[person[i].id] != 0){
			person[i].stu = true; 
			cnt++;
		}
	}
	sort(person,person+m,cmp);
	cout<<cnt<<endl;
	cout<<person[0].id;
	return 0;
}