A. Polycarp's Pockets

Polycarp has nn coins, the value of the ii-th coin is aiai. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.

For example, if Polycarp has got six coins represented as an array a=[1,2,4,3,3,2]a=[1,2,4,3,3,2], he can distribute the coins into two pockets as follows: [1,2,3],[2,3,4][1,2,3],[2,3,4].

Polycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.

Input
The first line of the input contains one integer nn (1≤n≤1001≤n≤100) — the number of coins.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1001≤ai≤100) — values of coins.

Output
Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.

Examples
inputCopy
6
1 2 4 3 3 2
outputCopy
2
inputCopy
1
100
outputCopy
1

相当于找众数，问众数出现的次数

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    while(cin >> n)
    {
        int a[105];
        for(int i = 0; i < n; ++i)
            cin >> a[i];
        sort(a, a + n);
        int b[105];
        int tot = 0;
        for(int i = 0; i < n; )
        {
            b[tot] = upper_bound(a, a + n, a[i]) - lower_bound(a, a + n, a[i]);
            i += b[tot];
            tot++;
        }
        sort(b, b + tot);
        cout << b[tot - 1] << '\n';
    }
    return 0;
}