1.先算出所有key的和的排序
2.对原来的list进行遍历,根据key对应的顺序,之后放到一个list中

List<String> sortedKeys = ...; // 第一步算的结果
List<Map<String, Integer>> originList = ...; // 原始数据集合
List<Map<String, Integer>> resultList = new ArrayList<Map<String, Integer>>();

for(Map<String,Integer> originMap : originList) {
    Map<String, Integer> sortedMap = new LinkedHashMap<String, Integer>();
    for(String sortedKey : sortedKeys) {
        sortedMap.put(sortedKey, originMap.get(sortedKey));
    }
    resultList.put(sortedMap);
}

有序 Map 可以用 TreeMap 来实现，所以我在示例中用的 java.util.TreeMap。

一般 SortedMap 都可以用一个 Comparator 作为构建参数，那么你可以自己写一个 Comparator 来实现排序，下面就是例子

import java.util.*;

public class Test {
    private SortedMap<String, Integer> first;
    private SortedMap<String, Integer> second;
    private SortedMap<String, Integer> third;
    private SortedMap<String, String> main;

    public Test() {
        first = new TreeMap<String, Integer>();
        second = new TreeMap<String, Integer>();
        third = new TreeMap<String, Integer>();
        main = new TreeMap<String, String>(new Comparator<String>() {
            public int compare(String k1, String k2) {
                Integer v1 = first.get(k1) + second.get(k1) + third.get(k1);
                Integer v2 = first.get(k2) + second.get(k2) + third.get(k2);
                return v2 - v1;
            }
        });
    }

    public void put(String key, String value, Integer v1, Integer v2, Integer v3) {
        first.put(key, v1);
        second.put(key, v2);
        third.put(key, v3);
        main.put(key, value);
    }

    public SortedMap<String, String> getMain() {
        return main;
    }

    public static void main(String[] args) {
        Test test = new Test();
        test.put("a", "aaaaaaaa", 1, 2, 3);
        test.put("b", "bbbbbbbb", 10, 20, 30);
        test.put("c", "cccccccc", 5, 15, 20);
        test.put("d", "dddddddd", 100, 1, 3);

        for (Map.Entry<String, String> entry : test.getMain().entrySet()) {
            System.out.println(entry.getKey() + " : " + entry.getValue());
        }
    }
}