Codeforces--52A--123-sequence

题目描述：
There is a given sequence of integers a1, a2, …, an, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.
输入描述:
The first line contains an integer n (1 ≤ n ≤ 106). The second line contains a sequence of integers a1, a2, …, an (1 ≤ ai ≤ 3).
输出描述:
Print the minimum number of replacements needed to be performed to make all the numbers in the sequence equal.
输入：
9
1 3 2 2 2 1 1 2 3
输出：
5
题意：
有一个给定的整数序列 a1, a2, …, an, 每一个数字都是大于等于1且小于等于3的。你可以将一个数替换成另外一个数，求最小的替换次数使全部数相等。
题解：
找到1，2，3中贡献最大的那个数，用n减一下就好了。
代码：