对比不同解法
最开始我写的
#include<iostream>
#include<algorithm>
using namespace std;
#include<cstring>
struct Peo
{
string name;
int year;
int month;
int day;
};
bool cmp(Peo a, Peo b)
{
if (a.year != b.year)
{
return a.year < b.year;
}
else if (a.year == b.year && a.month != b.month)
{
return a.month < b.month;
}
else if (a.year == b.year && a.month == b.month)
{
return a.day < b.day;
}
}
int main()
{
Peo arr[100000];
int n;
cin >> n;
char c;
string s1;
int n1;
int n2;
int n3;
int num = 0;
for (int i = 0; i < n; i++)
{
cin >> s1 >> n1 >> c >> n2 >> c >> n3;
if (((n1 < 1814) || (n1 ==