[Java][BaekJoon][10814] 나이순정렬(Comparator)

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

 

<힌트>

・Arrays

・Sort / Comparator

・Compare(o1, o2) > 0 일때 o1이 o2보다 크다고 간주, o1을 o2의 뒤에 위치시킴

<풀이코드>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        String[][] member = new String[N][2];
        for(int i = 0; i < N; i++) {
            member[i][0] = sc.next();
            member[i][1] = sc.next();
        }

        Arrays.sort(member, new Comparator<String[]>() {
            @Override
            public int compare(String[] o1, String[] o2) {
                return Integer.parseInt(o1[0]) - Integer.parseInt(o2[0]);
            }
        });

        for(int i = 0; i < N; i++) {
            System.out.println(member[i][0]+" "+member[i][1]);
        }

        }

    }