[백준] 10825번 국영수 - Java, 자바

난이도

실버 4

문제

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

풀이

Comparator를 이용해 정렬하는 문제
Comparator 사용법을 알고 있어야한다.

Arrays.sort(arr, new Comparator<String[]>(){
	@Override
    public int compare(String[] o1, String[] o2){
    	return Integer.parseInt(o1[1])-Integer.parseInt(o2[1]); // 오름차순 o1,o2
        // return Integer.parseInt(o2[1])-Integer.parseInt(o1[1]); // 내림차순 o2,o1
    }
});

코드

package 정렬;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class boj_10825 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());

        String[][] arr = new String[n][4];
        for(int i=0;i<n;i++){
            StringTokenizer st = new StringTokenizer(br.readLine());

            arr[i][0] = st.nextToken();
            arr[i][1] = st.nextToken();
            arr[i][2] = st.nextToken();
            arr[i][3] = st.nextToken();

        }

        Arrays.sort(arr,new Comparator<String[]>(){
            @Override
            public int compare(String[] o1, String[] o2){
                if(o2[1].equals(o1[1])){
                    if(o1[2].equals(o2[2])){
                        if(o1[3].equals(o2[3])){
                            return o1[0].compareTo(o2[0]);
                        }
                        return Integer.parseInt(o2[3])-Integer.parseInt(o1[3]);
                    }

                    return Integer.parseInt(o1[2])-Integer.parseInt(o2[2]);

                }
                return Integer.parseInt(o2[1])- Integer.parseInt(o1[1]);
            }
        });

        for(int i=0;i<arr.length;i++){
            System.out.println(arr[i][0]);
        }

    }
}