Equalize problem codeforces

#include <iostream>
#include <algorithm>

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

    int freq[101] = {0};

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

    int maxFreq = *std::max_element(freq, freq + 101);

    int moves = n - maxFreq;

    std::cout << moves;

    return 0;
}