Submission
Status:
PPP--PPPPP
Subtask/Task Score:
80/100
Score: 80
User: Tjeez
Problemset: กองชาม
Language: cpp
Time: 0.014 second
Submitted On: 2026-09-21 16:01:09
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n];
int count[n]={0};
for (int i=0;i<n;i++) cin>>arr[i];
for (int i=0;i<n;i++){
int temp=arr[i];
count[temp]+=1;
}
int max=-2e9;
for (int i=0;i<n;i++){
if(count[i]>max){
max=count[i];
}
}
cout<<max;
}