题目链接:生日
题目描述
cjf 君想调查学校 OI 组每个同学的生日,并按照年龄从大到小的顺序排序。但 cjf 君最近作业很多,没有时间,所以请你帮她排序。
输入格式
输入共有 n + 1 n + 1 n+1 行,
第 1 1 1 行为 OI 组总人数 n n n;
第 2 2 2 行至第 n + 1 n+1 n+1 行分别是每人的姓名 s s s、出生年 y y y、月 m m m、日 d d d。
输出格式
输出共有 n n n 行,
即 n n n 个生日从大到小同学的姓名。(如果有两个同学生日相同,输入靠后的同学先输出)
样例 #1
样例输入 #1
3
Yangchu 1992 4 23
Qiujingya 1993 10 13
Luowen 1991 8 1
样例输出 #1
Luowen
Yangchu
Qiujingya
提示
数据保证, 1 < n < 100 1<n<100 1<n<100, 1 ≤ ∣ s ∣ < 20 1\leq |s|<20 1≤∣s∣<20。保证年月日实际存在,且年份 ∈ [ 1960 , 2020 ] \in [1960,2020] ∈[1960,2020]。
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
static List<Student> students = new ArrayList<>();
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
for (int i = 0; i < n; i++) {
String name = scanner.next();
int year = scanner.nextInt();
int month = scanner.nextInt();
int day = scanner.nextInt();
students.add(new Student(name, year, month, day));
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (students.get(i).year > students.get(j).year || students.get(i).year == students.get(j).year && students.get(i).month > students.get(j).month || students.get(i).year == students.get(j).year && students.get(i).month == students.get(j).month && students.get(i).day >= students.get(j).day) {
Student student = students.get(i);
students.set(i, students.get(j));
students.set(j, student);
}
}
}
for (int i = 0; i < n; i++) {
System.out.println(students.get(i).name);
}
}
}
class Student {
public Student(String name, int year, int month, int day) {
this.name = name;
this.year = year;
this.month = month;
this.day = day;
}
public Student() {
}
String name;
int year;
int month;
int day;
}