洛谷：P1104 生日 (结构体排序)

传送门

思路： 虽然是个水题，但是不认真读题的下次就是一直wa，一定记着在结构体排序时同年同月同日生的人要 id大的在前。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int n;

struct node{
    string name;
    int year, month, day;
    int id;
}a[N];

bool cmp(node a, node b){
    if(a.year != b.year) return a.year < b.year;
    else{
        if(a.month != b.month) return a.month < b.month;
        else{
            if(a.day != b.day) return a.day < b.day;
            else return a.id > b.id; //同年同月同日生的id大在前
        }
    }
}

signed main(){
    IOS;

    cin >> n;
    for(int i = 0; i < n; i ++){
        a[i].id = i;
        cin >> a[i].name >> a[i].year >> a[i].month >> a[i].day;
    }
    sort(a, a + n, cmp);
    for(int i = 0; i < n; i ++) cout << a[i].name << endl;

    return 0;
}