[백준_10814] 나이순 정렬 - JAVA

문제 출처

https://www.acmicpc.net/problem/10814

풀이

• List로 데이터를 저장한 후, Collections.sort()를 이용하면 쉽게 풀 수 있는 문제이다.

코드

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static class Member {
        int age;
        String name;

        public Member(int age, String name) {
            this.age = age;
            this.name = name;
        }
    }
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine());
        List<Member> list = new ArrayList<>();
        int N = Integer.parseInt(stringTokenizer.nextToken());
        for (int i = 0; i < N; i++) {
            stringTokenizer = new StringTokenizer(bufferedReader.readLine());
            list.add(new Member(Integer.parseInt(stringTokenizer.nextToken()), stringTokenizer.nextToken()));
        }
        Collections.sort(list, new Comparator<Member>() {
            @Override
            public int compare(Member o1, Member o2) {
                return o1.age - o2.age;
            }
        });
        for (Member member: list) {
            System.out.println(member.age + " " + member.name);
        }
    }
}

채점 결과