算法题

 

import java.util.*;

public class demo1 {
    
   /**
     * 3
     * cc 100 100 90
     * aa 80 90 100
     * bb 90 100 100
     * 输入m 为学生人数
     * 之后的m行表示各个学生及成绩
     * 输出排好序的信息
     * @param args
     */
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.valueOf(scanner.nextLine());
        String[] arr = new String[n];
        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextLine();
        }
        int[] sumArr = new int[n];
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            String[] tmpArr = arr[i].split(" ");
            int sum = Integer.valueOf(tmpArr[1]) + Integer.valueOf(tmpArr[2]) + Integer.valueOf(tmpArr[3]);
            sumArr[i] = sum;
            map.put(i, sum);
        }
        Arrays.sort(sumArr);
        HashMap<Integer, Integer> removeMap = new HashMap<>();
        for (int j = n - 1; j >= 0; j--) {
            for (Integer key : map.keySet()) {
                if (map.get(key).equals(sumArr[j]) && !removeMap.containsKey(key)) {
                    System.out.println(arr[key]);
                    removeMap.put(key, map.get(key));
                }
            }
        }
        
        
    }
    
    
}