成绩排序

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        int x = sc.nextInt();
        Scanner in = new Scanner(System.in);
        Map<String, Integer> map = new HashMap<>();
        for (int j = 0; j < t; j++) {
            String s = in.nextLine();
            String mark = "";
            String name = "";
            for (int i = 0; i < s.length(); i++) {
//                if (s.charAt(i) != '\t') {
                    if (s.charAt(i) >= '0' && s.charAt(i) <= '9') {
                        mark += s.charAt(i);
                    } else {
                        name += s.charAt(i);
                    }
//                }
            }
            map.put(name, Integer.valueOf(mark));
        }
        if(x==1){
            map.entrySet().stream().sorted(Map.Entry.comparingByValue()).forEach(stringIntegerEntry -> System.out.println(stringIntegerEntry.getKey()+stringIntegerEntry.getValue()));
        }else  if(x==0){
            map.entrySet().stream().sorted(Map.Entry.<String, Integer>comparingByValue().reversed()).forEach(stringIntegerEntry -> System.out.println(stringIntegerEntry.getKey()+stringIntegerEntry.getValue()));
        }

    }
}

为什么这个牛客上报错，idea上效果是有了

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static class Grade{
		static int ccc=0;
		int count;   //模拟时间戳，解决快排不稳定的问题
		int mark;
		String name;
		Grade(int mark,String name){
			this.mark=mark;
			this.name=name;
			ccc++;
			this.count=ccc;
		}

	}
	public static void main(String[] args) {
		Scanner read=new Scanner(System.in);
		while(read.hasNext()) {
			int n=read.nextInt();
			int flag=read.nextInt();
			Grade[] arr=new Grade[n];
			Grade.ccc=0;
			for(int i=0;i<n;i++) {
				String name=read.next();
				int x=read.nextInt();
				arr[i]=new Grade(x,name);
			}
			if(flag==1)
				Arrays.sort(arr,(a,b)->{
					if(a.mark!=b.mark)
						return a.mark-b.mark;    //升序
					else return a.count-b.count;  //相同成绩则按照count升序排列
				});
			else
				Arrays.sort(arr,(a,b)->{
					if(a.mark!=b.mark)
						return b.mark-a.mark;    //降序
					else return a.count-b.count;  //相同则按count升序
				});
			
			for(int i=0;i<n;i++)
				System.out.println(arr[i].name+" "+arr[i].mark);
		}
	}
}

import java.util.Scanner;
import java.util.LinkedList;

// Java 桶排序算法复杂度，O(n) 
// 101个桶，分别保存 0~100分的学生名称， 然后按照ascOrDesc打印出来
public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    while(scanner.hasNext()) {
      int stuNum = scanner.nextInt();
      int ascOrDesc = scanner.nextInt();
      LinkedList<String>[] numAndNameList = new LinkedList[101];
      for(int i = 0 ; i < stuNum; i++){
        String name = scanner.next();
        int scoreNum = scanner.nextInt();
        if (numAndNameList[scoreNum] == null) {
          numAndNameList[scoreNum] = new LinkedList<>();
        }
        numAndNameList[scoreNum].addLast(name);
      }
      if (ascOrDesc == 1) {
        for (int i = 0; i <= 100; i++) {
          if (numAndNameList[i] != null) {
            while (!numAndNameList[i].isEmpty()) {
              System.out.println(numAndNameList[i].pollFirst() + " " + i);
            }
          }
        }
      } else {
        for (int i = 100; i >= 0; i--) {
          if (numAndNameList[i] != null) {
            while (!numAndNameList[i].isEmpty()) {
              System.out.println(numAndNameList[i].pollFirst() + " " + i);
            }
          }
        }
      }
    }
  }
} 

//很懵，同样的数据在本地没问题，在线就是 没有数据输出。

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.Exception;

public class Main{
    public static void main(String[] args) throws Exception{
        BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
        
        int mid;String midStr;
        int i = 0;
         
        int length = Integer.parseInt(sc.readLine());
        int type = Integer.parseInt(sc.readLine());
        
        String[] listName = new String[length];
        Integer[] listScore = new Integer[length];
        
        for(i=0;i < length;i++) {    String[] transition = sc.readLine().split(" ");  listName[i] = transition[0];  listScore[i] = Integer.parseInt(transition[1]);     
        }
        
        //bubbleSort
        if(type == 0){  for(i = 0;i<length-1;i++)  for(int j = length - 1;j > i;j--){   if(listScore[j] > listScore[j-1]){
                    mid = listScore[j];
                    listScore[j] = listScore[j-1]; 
                    listScore[j-1] = mid;

                    midStr = listName[j];
                    listName[j] = listName[j-1];
                    listName[j-1] = midStr;
                }  }
        }else if(type == 1){  for(i = 0;i<length-1;i++)  for(int j = length - 1;j > i;j--){   if(listScore[j] < listScore[j-1]){
                    mid = listScore[j];
                    listScore[j] = listScore[j-1]; 
                    listScore[j-1] = mid;

                    midStr = listName[j];
                    listName[j] = listName[j-1];
                    listName[j-1] = midStr;
                }  }
        }  for(i=0;i<length;i++)   System.out.println(listName[i] + " " + listScore[i]);  sc.close(); 
     }
}

import java.util.*;
import java.util.Map.Entry;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            int nums = Integer.valueOf(sc.nextLine());
            int sort = Integer.valueOf(sc.nextLine());
            Map<String,Integer> tmap = new TreeMap<>();
            for(int i=0;i<nums;i++){
                String str = sc.nextLine();
                int spIndex = str.indexOf(" ");
                tmap.put(str.substring(0,spIndex),Integer.valueOf(str.substring(spIndex+1)));
            }
            List<Map.Entry<String,Integer>> list = new ArrayList<>(tmap.entrySet());
            if(sort==1){
                Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
                    public int compare(Entry<String, Integer> o1,
                            Entry<String, Integer> o2) {
                        return o1.getValue().intValue() > o2.getValue().intValue() ? 1:-1;
                    }
                });
            }else{
                Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
                    public int compare(Entry<String, Integer> o1,
                            Entry<String, Integer> o2) {
                        return o1.getValue().intValue() > o2.getValue().intValue() ? -1:1;
                    }
                });
            }
            for(Map.Entry<String,Integer> maps : list){
                System.out.println(maps.getKey()+" "+maps.getValue());
            }
        }
    }
}

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

class Student {
    private String name;
    private int grade;

    public Student(String name, int grade) {
        this.name = name;
        this.grade = grade;
    }

    public String getName() {
        return name;
    }

    public int getGrade() {
        return grade;
    }

    public String toString() {
        return name + " " + grade;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            int n = scan.nextInt();
            int sort_type = scan.nextInt();
            Student[] arr = new Student[n];
            for (int i = 0; i < arr.length; i++) {
                String name = scan.next();
                int grade = scan.nextInt();
                arr[i] = new Student(name, grade);
            }
            //sort_type为0则降序
            if (sort_type == 0) {
                Arrays.sort(arr, new Comparator<Student>() {
                    @Override
                    public int compare(Student o1, Student o2) {
                        return o2.getGrade() - o1.getGrade();
                    }
                });
            } else if (sort_type == 1) {//sort_type为1则升序
                Arrays.sort(arr, new Comparator<Student>() {
                    @Override
                    public int compare(Student o1, Student o2) {
                        return o1.getGrade() - o2.getGrade();
                    }
                });
            } else {
                System.out.println("sort_type为0则降序，sort_type为1则升序，请重新输入。");
            }
            for (int i = 0; i < arr.length; i++) {
                System.out.println(arr[i].toString());
            }
        }
    }
}

public class Main {

import java.util.Arrays;
import java.util.Scanner;

public class Main {     @SuppressWarnings("resource")     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         int studentSum = scanner.nextInt();// 学生总数         int upOrDown = scanner.nextInt();// 成绩上升还是下降         if (upOrDown == 1) {             StudentDown[] studentDown = new StudentDown[studentSum];             for (int i = 0; i < studentSum; i++) {                 String name = scanner.next();                 int score = scanner.nextInt();                 studentDown[i] = new StudentDown(name, score);             }             Arrays.sort(studentDown);             for (StudentDown studentDown2 : studentDown) {                 System.out.println(studentDown2.getName() + " " + studentDown2.getScore());             }         } else if (upOrDown == 0) {             StudentUp[] studentUp = new StudentUp[studentSum];             for (int i = 0; i < studentSum; i++) {                 String name = scanner.next();                 int score = scanner.nextInt();                 studentUp[i] = new StudentUp(name, score);             }             Arrays.sort(studentUp);             for (StudentUp studentDown2 : studentUp) {                 System.out.println(studentDown2.getName() + " " + studentDown2.getScore());             }         }     }
}

class StudentUp implements Comparable<StudentUp> {     public StudentUp(String name, int score) {         super();         this.name = name;         this.score = score;     }     private String name;     private int score;     public String getName() {         return name;     }     public void setName(String name) {         this.name = name;     }     public int getScore() {         return score;     }     public void setScore(int score) {         this.score = score;     }     @Override     public int compareTo(StudentUp studentUp) {         // TODO Auto-generated method stub         if (this.score < studentUp.score) {             return 1;         } else if (this.score > studentUp.score) {             return -1;         }         return 0;     }

}

class StudentDown implements Comparable<StudentDown> {     public StudentDown(String name, int score) {         super();         this.name = name;         this.score = score;     }     private String name;     private int score;     public String getName() {         return name;     }     public void setName(String name) {         this.name = name;     }     public int getScore() {         return score;     }     public void setScore(int score) {         this.score = score;     }     @Override     public int compareTo(StudentDown studentDown) {         // TODO Auto-generated method stub         if (this.score < studentDown.score) {             return -1;         } else if (this.score > studentDown.score) {             return 1;         }         return 0;     }

}

	

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n;
		int h;
		Student sts[];
		
		
		while(sc.hasNext()){
			n = Integer.parseInt(sc.nextLine());
			h = Integer.parseInt(sc.nextLine());	
			sts = new Student[n];
			for(int i = 0;i<n;i++){
				String s[]= sc.nextLine().split(" ");
				int score = Integer.parseInt(s[1]);
				String name = s[0];
				sts[i] = new Student(name,score);
			}
			InsertSort iss = new InsertSort();
			if(h==1){
                sts = iss.sort(sts);
            }else{
                 sts = iss.sort2(sts);
            }
			
			//if(h == 1){
				for(int i = 0;i<n;i++){
					System.out.println(sts[i].getName()+" "+sts[i].getScore());
				}
			//}else{
				//for(int i = n-1;i>=0;i--){
				//	System.out.println(sts[i].getName()+" "+sts[i].getScore());
				//}
			//}
			
			
			//n = sc.nextInt();
			//h = sc.nextInt();	
			//sts = new Student[n];
		}

	}

}

class Student{
	private int score;
	private String name;
	public Student(String name,int score){
		this.score = score;
		this.name = name;
	}
	
	public int getScore() {
		return score;
	}
	public void setScore(int score) {
		this.score = score;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	
	
}

//拿到一个写好的排序类,哈哈哈插入排序是稳定的，本来想着只升序排，倒着出，结果就。。。搞了半天
class InsertSort {
	public Student[] sort(Student[] arr){
		for( int j = 1; j<arr.length;j++){
			Student temp = arr[j];
			int i = j-1;
			while(i>-1&&temp.getScore()<arr[i].getScore()){
				arr[i+1] = arr[i];
				i--;
			}
			arr[i+1] = temp;
		}
		return arr;
	}
    
    
    public Student[] sort2(Student[] arr){
		for( int j = 1; j<arr.length;j++){
			Student temp = arr[j];
			int i = j-1;
			while(i>-1&&temp.getScore()>arr[i].getScore()){
				arr[i+1] = arr[i];
				i--;
			}
			arr[i+1] = temp;
		}
		return arr;
	}
}