Byte jump 2020 autumn recruitment programming question: quickly find your own ranking according to the job number

Topic content ： Quickly find your own ranking according to your job number .
Enter an integer in the first line n Total number of Representatives ;
On the second line, enter an integer m Represent your job number （ Job No m The order of the inputs ）;
On the third line, enter everyone's score .
give an example
5 // The total number of 5 personal
2 // The job number is 2
5 4 3 2 1 //5 The individual scores in order are 5 branch ,4 branch ,3 branch ,2 branch ,1 branch
Find out that the job number is 2 The ranking of is used as the output . Be careful ： Enter here in order , Job number 0 Is the first person , got 5 branch , Job number 2 That's it 3 branch , Output 3 Ranking in everyone's score , That's the third place , Output value 3.
Program reference example ：

import java.util.*;
public class test17_zijie {
    	 
  public static void main(String[] args) {
    
	Scanner in=new Scanner(System.in);
	int n=in.nextInt();// The total number of n
	int m=in.nextInt();// Your job No m individual 
	int arr[]=new int[n];// The length is n To store scores 
	int k=0;
	int res=0;// Ranking initialization 
	int score=0;
	while(n>0) {
    
		arr[k++]=in.nextInt();// The scores entered are stored in the array in turn 
		n--;
	}
	score=arr[m];// Job number m Corresponding score 
	Arrays.sort(arr);// Sort all the data of the array from small to large 
	
	for (int i = 0; i < arr.length; i++) {
    
		if(score==arr[i]) {
    
			//System.out.println(i);
			res=arr.length-i;// Ranking  
		}	
	}
	System.out.println(res);
  }
}

Maybe there are better ideas, ha ha , The brain is not idle, so stop here .