20. 등수 구하기

이중for문

arr[j] > arr[i] 비교해서 등수 변경

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {

    public int[] solution(int n, int[] arr) {
        int[] answer = new int[n];
        for (int i = 0; i < n; i++) {
            int cnt=1;
            for (int j = 0; j < n; j++) {
                if(arr[j]>arr[i]) cnt++;
            }
            answer[i] = cnt;
        }

        return answer;
    }
   public static void main(String[] args){
       Main T = new Main();
       Scanner kb = new Scanner(System.in);
       int n=kb.nextInt();
       int[] arr =new int [n];
       for (int i = 0; i < n; i++) {
           arr[i]=kb.nextInt();
       }
       for (int x : T.solution(n,arr)) System.out.print(x + " ");

   }
}