Sistema de Rank

package me.trow;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

public class Teste implements Comparator<String>{

    public static HashMap<String, Integer> a = new HashMap<>();
    public static ArrayList<String> ab = new ArrayList<>();
    public static Teste m = new Teste(a);
    public static Map<String, Integer> base;
    public static TreeMap<String, Integer> b = new TreeMap<String,Integer>(m);

    public Teste(Map<String, Integer> base){
        this.base = base;
    }

    public int compare(String a, String b){
        if(base.get(a) >= base.get(b)){
            return -1;
        }else{
            return 1;
        }
    }

    public static void main(String[] args) {
        a.put("A", 10);
        a.put("B", 22);
        a.put("C", 130);
        a.put("D", 129);
        print("Desorganizado: "+a);
        b.putAll(a);
        for(String c : b.keySet()){
            ab.add(c);
        }
        for(int i = 0; i < 2;i++){
            print("AB: "+ab.get(i));
        }
    }

    public static void print(String a){
        System.out.println(a);
    }

}