在并行数组中按字母顺序排序like分数

Question

对于一项作业，我必须要求学生人数。提示用户输入学生的lastname和分数，然后按降序对分数排序并显示。我已经做了所有这些，但不知道如何排序的名字，如果他们有相同的分数。

约翰33岁

亚当33

菲尔22

我无法得到所需的输出。我通常能解决这类问题，但这个问题让我分崩离析…请救命！

import java.util.*;

public class className
{
    public static void main(String[] args)
    {
        //Scanner input for # of students
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the number of students: ");
        int numofstudents = input.nextInt();
        System.out.println();

        //Initializes an array of strings to the size of the # of students
        String[] names = new String[numofstudents];

        //Initializes an array of ints to the size of the # of students
        int[] array = new int[numofstudents];

        //For loop which asks for each students name and score until # of students reached
        for(int i = 0; i < numofstudents; i++)
        {
            System.out.print("Enter the student's lastname: ");
            names[i] = input.next();
            System.out.print("Enter the student's score: ");
            array[i] = input.nextInt();
            System.out.println();
        }
        //Sorts the arrays for names and scores of students
        selectionSort(names, array);
        //Output
        System.out.println();
        System.out.println();
        System.out.println("Number of Students: " + numofstudents);
        //System.out.println(Arrays.toString(names));
        for(int i = 0; i < numofstudents; i++)
        {
            System.out.println(names[i] + ": " + array[i]);
        }
    }

    public static void selectionSort(String[] names, int[] array) {
        for(int i = array.length - 1; i >= 1; i--) {
            String temp;
            int currentMax = array[0];
            int currentMaxIndex = 0;
            for(int j = 1; j <= i; j++) {
                if (currentMax > array[j]) {
                    currentMax = array[j];
                    currentMaxIndex = j;
                }
            }
                if (currentMaxIndex != i) {
                    temp = names[currentMaxIndex];
                    names[currentMaxIndex] = names[i];
                    names[i] = temp;
                    array[currentMaxIndex] = array[i];
                    array[i] = currentMax;
                }
        }
    }
}

Answer 1

实际上有两个排序要做。无论分数是多少，都要开始按字母顺序对数组进行排序。然后，根据分数对数组排序，就可以得到结果。

编辑：在按分数排序时，当t[i]=t[i-1]时应停止