解题思路:
注意事项:
参考代码:import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n=in.nextInt(),a[]=new int[n];
Set arr = new HashSet();
for(int i=0;i
a[i]=in.nextInt();
arr.add(a[i]);
}
Object res[] = new TreeSet(arr).toArray(); //升序
int cnt[]=new int[arr.size()];
for(int i=0;i
for(int j=0;j
if(a[j]==(int)res[i])
cnt[i]++;
}
for(int i=0;i
System.out.println((int)res[i]+" "+cnt[i]);
in.close();
}
}