数字排序

package geekfly.test;

import java.util.Scanner;

public class 数字排序 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int arr[]= new int[1001];
        int num = sc.nextInt();
        for (int i = 0; i < num; i++) {
            arr[sc.nextInt()]++;
        }
        int n=0,m=0;
        for(int i=0;i<1001;i++){
            for(int j=0;j<1001;j++){
                if(arr[j]>arr[n]){
                    n = j;
                }
            }
            if(arr[n]==0)
                break;
            System.out.println(n + " " + arr[n]);

            arr[n] = 0;
        }
    }

}