Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class Ege11 {
- public static void main(String [] args) {
- final int num = 13;
- Scanner s = new Scanner(System.in);
- int N = s.nextInt();
- int[] number = new int[num];
- int[] count = new int[num];
- for (int i = 1; i < num ; i++){
- count[i] = 0;
- number[i] = i;
- }
- for (int i = 0; i < N; i++) {
- int A = s.nextInt();
- count[A]++;
- }
- int t = 0;
- int p = 0;
- for(int i = 1; i < num; i++){
- for(int j = 2 ; j < num; j++){
- if( count[j] > count[j-1]){
- t = count[j];
- count[j] = count[j-1];
- count[j-1] = t;
- p = number[j];
- number[j] = number[j-1];
- number[j-1] = p;
- }
- }
- }
- for(int i = 1 ; i < num; i++){
- if(count[i] > 0){
- System.out.println(number[i] + " " + count[i]);
- }
- }
- }}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement