用一维数组存储学号和成绩,然后,按成绩排序输出

输入描述:

输入第一行包括一个整数N(1<=N<=100),代表学生的个数。接下来的N行每行包括两个整数p和q,分别代表每个学生的学号和成绩。
输出描述:
按照学生的成绩从小到大进行排序,并将排序后的学生信息打印出来。如果学生的成绩相同,则按照学号的大小进行从小到大排序。
输入例子:
3
1 90
2 87
3 92
输出例子:

 

2 87
1 90
3 92

java代码:

import java.util.Scanner;
 
public class Main {
    
    public static void main(String[] args) {
        
        Scanner sc =new Scanner(System.in);
        while(sc.hasNext()){
            int n=sc.nextInt();
            int[] number =new int[n];
            int[] grade =new int[n];
            for(int i=0;i                 number[i]=sc.nextInt();
                grade[i] =sc.nextInt();
            }
            for(int i=0;i                 for(int j=0;j                     if(grade[j]>grade[j+1]){
                        int tem=grade[j+1];
                        grade[j+1]=grade[j];
                        grade[j]=tem;
                        tem=number[j];
                        number[j]=number[j+1];
                        number[j+1]=tem;
                    }else if(grade[j]==grade[j+1]){
                        if(number[j]>number[j+1]){
                            int tem=number[j];
                            number[j]=number[j+1];
                            number[j+1]=tem;
                        }
                    }                 
                }
            }
            for(int i=0;i                 System.out.println(number[i]+" "+grade[i]);
            }
        }                         
        sc.close();   
    }
 
}

 

你可能感兴趣的:(java面试题目)