Advertisement
Guest User

Untitled

a guest
May 24th, 2018
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.08 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class Ege11 {
  4.     public static void main(String [] args) {
  5.         final int num = 13;
  6.         Scanner s = new Scanner(System.in);
  7.         int N = s.nextInt();
  8.         int[] number = new int[num];
  9.         int[] count = new int[num];
  10.         for (int i = 1; i < num ; i++){
  11.             count[i] = 0;
  12.             number[i] = i;
  13.         }
  14.         for (int i = 0; i < N; i++) {
  15.             int A = s.nextInt();
  16.             count[A]++;
  17.         }
  18.         int t = 0;
  19.         int p = 0;
  20.         for(int i = 1; i < num; i++){
  21.             for(int j = 2 ; j < num; j++){
  22.                 if( count[j] > count[j-1]){
  23.                     t = count[j];
  24.                     count[j] = count[j-1];
  25.                     count[j-1] = t;
  26.                     p = number[j];
  27.                     number[j] = number[j-1];
  28.                     number[j-1] = p;
  29.                 }
  30.             }
  31.         }
  32.         for(int i = 1 ; i < num; i++){
  33.             if(count[i] > 0){
  34.                 System.out.println(number[i] + " " + count[i]);
  35.             }
  36.         }
  37.     }}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement