등수의 정답

import java.util.*;

public class Main {
    public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      int base_arr[] = new int[5];
      int sort_arr[] = new int[5];
      for(int i = 0; i < 5; i++)
      {
        base_arr[i] = sc.nextInt();
        sort_arr[i] = base_arr[i];
      }
      
      for(int i = 0; i < 5; i++)
      {
        for(int j = i; j < 5; j++)
        {
          if(sort_arr[i] < sort_arr[j])
          {
            int tmp = sort_arr[i];
            sort_arr[i] = sort_arr[j];
            sort_arr[j] = tmp;
          }
        }
      }
      
      int base_count = 1;
      int rank_count = 1;
      int prev_info = sort_arr[0];
      int rank[] = new int[5];
      for(int curr_info: sort_arr)
      {
        if(prev_info != curr_info)
        {
          rank_count = base_count;
          prev_info = curr_info;
        }
        
        for(int i=0; i < 5; i++)
        {
          if(rank[i] != 0) continue;
          if(base_arr[i] == curr_info)
          {
            rank[i] = rank_count;
            base_count++;
          }
        }
      }
      
      for(int tmp:rank)
      {
        System.out.print(tmp + " ");
      }
    }
}