package 华为; import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main3 {     public static void main(String[] args) {         HashMap<String, String> map=new HashMap<String, String>();         HashMap<String, String> map1=new HashMap<String, String>();         Scanner sc=new Scanner(System.in);         int n=sc.nextInt();         String[] old=new String[n];         for(int i=0;i<old.length;i++){             old[i]=sc.next();             map.put(old[i].split(",")[2], old[i].split(",")[0]+","+old[i].split(",")[1]);         }         int m=sc.nextInt();         String[] news=new String[m];         for(int j=0;j<m;j++){             news[j]=sc.next();             map1.put(news[j].split(",")[0]+","+news[j].split(",")[1], news[j].split(",")[2]+","+news[j].split(",")[3]);         }                  for(Map.Entry<String, String> entry:map.entrySet()){             if(map1.containsKey(entry.getValue())){                 map.put(entry.getKey(), map1.get(entry.getValue()));             }         }         for(Map.Entry<String, String> entry:map.entrySet()){             System.out.println(entry.getValue()+","+entry.getKey());         }                       } } 最后没时间排序了，c了0.1   如果排序后差不多能c