2022.7.25 LeetCode AcWing

LeetCode
题解如下：
https://leetcode.cn/problems/complete-binary-tree-inserter/solution/919-by-sen-xm-2gev/

AcWing
模拟

#include <bits/stdc++.h>
using namespace std;

const int N = 1e3 + 10;

int n;

struct Student {
	string name;
	int age;
	int grade;
} student[N];

bool cmp(Student a, Student b) {
	if (a.grade == b.grade) {
		if (a.name == b.name) {
			return a.age < b.age;
		}
		return a.name < b.name;
	}
	return a.grade < b.grade;
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> student[i].name >> student[i].age >> student[i].grade;
	}

	sort(student, student + n, cmp);

	for (int i = 0; i < n; i++) {
		cout << student[i].name << " " << student[i].age << " " << student[i].grade << endl;
	}

	return 0;
}