C++ 算法：使整数序列元素相等的最少替换次数

#include

int main() { int n; std::cin >> n;

std::vector<int> sequence(n);
for (int i = 0; i < n; i++) {
    std::cin >> sequence[i];
}

int count1 = 0, count2 = 0, count3 = 0;
for (int i = 0; i < n; i++) {
    if (sequence[i] == 1) {
        count1++;
    } else if (sequence[i] == 2) {
        count2++;
    } else if (sequence[i] == 3) {
        count3++;
    }
}

int maxCount = std::max(std::max(count1, count2), count3);
int replaceCount = n - maxCount;

std::cout << replaceCount << std::endl;

return 0;

}