소프티어

import java.io.*;
import java.util.*;


public class Main {
    static int n;


    public static void main(String[] args) {


      Scanner sc = new Scanner(System.in);


      n = sc.nextInt();
      int last[] = new int [n];
      int lastcopy[] = new int [n];
      for(int i=0;i<3;i++){
        int people[] = new int [n];
        
        int score[] = new int [n];
        
        for(int j=0;j<n;j++){
          people[j] = sc.nextInt();
          score[j] = people[j];
          last[j] += people[j];
          lastcopy[j] += people[j];
        }
        calc(score, people);
    }
      calc(last, lastcopy);


     } 


  public static void calc(int score[], int people[]){
    
        int grade[] = new int [n];
    
        Arrays.sort(score);


        grade[score.length-1] = 1;
        
        for(int k=score.length-2;k>=0;k--){
          if(score[k+1] == score[k]){
            grade[k] = grade[k+1];
          }
          else{
            grade[k] = score.length-k; 
          }       
      }
      HashMap<Integer, Integer> map = new HashMap<>();


      for(int k=0;k<score.length;k++){
        map.put(score[k], grade[k]);
      }


        for(int k=0;k<people.length;k++){
          if(k == people.length-1){
            System.out.print(map.get(people[people.length-1]));
          }
          else{
            System.out.print(map.get(people[k]) + " ");
          }
        }
        System.out.println();
    
  }
}

코드는 이건데 0.0001초 차이로 같은 코드인데 맞기도하고 틀리기도 하네요 허허 어떤 방법이 확실할까요??