import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n=cin.nextInt();
Team[] team=new Team[3];
for(int i=0;i<3;i++)
{
team[i]=new Team(i+1,0);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
{
String s=cin.next();
if(s.equals("right"))
{
team[j].score+=10;
}
else if(s.equals("wrong"))
{
team[j].score-=10;
}
}
}
Arrays.sort(team,(a,b)->b.score-a.score);
System.out.print("("+team[0].no+","+team[0].score+")");
for(int i=1;i<3;i++)
{
if(team[i].score<team[i-1].score)
{
System.out.println();
}
System.out.print("("+team[i].no+","+team[i].score+")");
}
}
}
class Team
{
int no;
Integer score;
public Team(int no, Integer score) {
super();
this.no = no;
this.score = score;
}
}
竞赛评分
最新推荐文章于 2024-07-22 22:58:19 发布