Submission

PPPPPPPPPP

Score: 100

User: Whally

Problemset: กองชาม

Language: cpp

Time: 0.011 second

Submitted On: 2025-04-05 01:20:16

#include <bits/stdc++.h>
using namespace std;
int p[100100];
map<int,int> mp;
int main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, mx = -1e9;
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> p[i];
    }
    sort(p+1,p+1+n);
    for (int i = 1; i <= n; i++){
        mp[p[i]]++;
        mx = max(mx,mp[p[i]]);
    }
    cout << mx;

    return 0;
}