-
Notifications
You must be signed in to change notification settings - Fork 137
/
Solution.java
31 lines (27 loc) 路 720 Bytes
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
static int equalizeArray(int[] arr) {
int cache[] = new int[100];
for (int i = 0; i < arr.length; i++) { cache[arr[i] - 1]++; }
int max = 0;
for (int i = 0; i < cache.length; i++) {
max = Math.max(max, cache[i]);
}
return arr.length - max;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for(int arr_i = 0; arr_i < n; arr_i++){
arr[arr_i] = in.nextInt();
}
int result = equalizeArray(arr);
System.out.println(result);
in.close();
}
}