科大讯飞后面两题

/**
第二题
**/
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
   class Team{   String name;   int grade;   int realwin;   int in;  public Team(String name, int grade, int realwin, int in) {  super();  this.name = name;  this.grade = grade;  this.realwin = realwin;  this.in = in;  }  public void setGrade(int grade) {  this.grade = grade;  }  public void setRealwin(int realwin) {  this.realwin = realwin;  }  public void setIn(int in) {  this.in = in;  }
   }  public static void main(String[] args) {  Scanner sc=new Scanner(System.in);  Main main=new Main();
        while(sc.hasNext()){  String ns=sc.nextLine();  int n=Integer.valueOf(ns);  Team []win=new Team[n];  TreeMap<String,Team>map=new TreeMap<>();  for(int i=0;i<n;i++){  String cname=sc.nextLine();  Team team=main.new Team(cname,0,0,0);  map.put(cname, team);  }  int len=(n*(n-1))/2;  for(int i=0;i<len;i++){  String []str=sc.nextLine().split(" ");  String cname=str[0].charAt(0)+"";  String cname2=str[0].charAt(2)+"";  String []grad=str[1].split(":");  int c1=Integer.valueOf(grad[0]);  int c2=Integer.valueOf(grad[1]);  int c=c1-c2;  int grade1=0;  int realwin1=0;  int in1=c1;    int grade2=0;  int realwin2=0;  int in2=c2;  if(c==0){  grade1=1;  grade2=1;  }  if(c>0){  grade1=3;  realwin1=c;  }  if(c<0){  grade2=3;  realwin2=c2-c1;  }  Team team=map.get(cname);  team.setGrade(team.grade+grade1);  team.setIn(team.in+in1);  team.setRealwin(team.realwin+realwin1);  map.put(cname, team);    Team team2=map.get(cname2);  team2.setGrade(team2.grade+grade2);  team2.setIn(team2.in+in2);  team2.setRealwin(team2.realwin+realwin2);  map.put(cname2, team2);  }  int i=0;  for(String key:map.keySet()){  win[i++]=map.get(key);  }  Arrays.sort(win, new Comparator<Team>(){  @Override  public int compare(Team o1, Team o2) {  int grade=o2.grade-o1.grade;  int realwin=o2.realwin-o1.realwin;  int in=o2.in-o1.in;  if(grade!=0)return grade;  else if(realwin!=0)return realwin;  else return in;  }  });  String []name=new String[n/2];  for(i=0;i<n/2;i++){  name[i]=win[i].name;  }    Arrays.sort(name);  for(i=0;i<n/2;i++){  System.out.println(name[i]);  }
        }  }
}

	

/**
第三题
**/
import java.util.ArrayList;
import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {  public static void main(String[] args) {  Scanner sc=new Scanner(System.in);
        while(sc.hasNext()){  String ns=sc.nextLine();  int n=Integer.valueOf(ns);  TreeMap<String,ArrayList<String>> map =new TreeMap<String,ArrayList<String>>();
            for(int i=0;i<n;i++){  String []ss=sc.nextLine().split(" ");  if(map.containsKey(ss[0])){  map.get(ss[0]).add(ss[1]);    }else{  ArrayList<String> list=new ArrayList<>();  list.add(ss[1]);  map.put(ss[0], list);  }
            }
            boolean flag=true;
            for(String key:map.keySet()){  ArrayList<String> list =map.get(key);  if(list.size()>1){  System.out.print(key);  flag=false;  Iterator<String> it=list.iterator();  while(it.hasNext()){  System.out.print(" "+it.next());  }  System.out.println();  }
            }
            if(flag){  System.out.println("YES");
            }
        }  }
}