#include <bits/stdc++.h>
using namespace std;
const int N = 2e3+5;
int n,ans=0,maxn;
int a[N],b[N*10];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i],maxn=max(maxn,a[i]);
	sort(a+1,a+1+n);
	for(int i=1;i<=n;i++)
	{
		b[a[i]]++;
	}
	int ans=0;
	for(int i=0;i<=maxn;i++)
	{
		ans=max(ans,b[i]);
	}
	cout<<ans;
	return 0;
 }

Python 队列可写

a=int(input())
k=list(map(int,input().split()))
t=[0]*(max(k)+1)
st=[0]*1000
top=0
tail=0
for i in range(a):
    t[k[i]]+=1
for i in range(len(t)):
    while t[i]!=0:
        if tail!=top and i>st[top]:
            top+=1
        st[tail]=i
        tail+=1
        t[i]-=1     
print(tail-top)