Submission

Status:

PPPPPPPPPP

Score: 100

User: Winzzwz

Problemset: กองชาม

Language: cpp

Time: 0.010 second

Submitted On: 2025-03-05 12:32:40

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n,mx;
map <int,int> cnt;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int nn; cin >> nn;
        cnt[nn]++;
        mx = max(cnt[nn],mx);
    }
    cout << mx;

    return 0;
}