TLE求调

#include<bits/stdc++.h>
using namespace std;
int n,m,a[300005],j=1,c[300005];
template<typename type>
inline void read(type &x)
{
	x=0;bool flag(0);char ch=getchar();
	while(!isdigit(ch)) flag=ch=='-',ch=getchar();
	while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	flag?x=-x:0;
}
template<typename type>
inline void write(type x,bool mode=1)
{
	x<0?x=-x,putchar('-'):0;static short Stack[50],top(0);
	do Stack[++top]=x%10,x/=10; while(x);
	while(top) putchar(Stack[top--]|48);
	mode?putchar('\n'):putchar(' ');
}

signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){cin>>a[i];}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(a[i]==a[i+1]) c[j]++;
		else {
			c[j]+=1;
			j++;
		}
	}

	for(int k=1;k<=n;k++){
		if(k==1) cout<<n<<" ";
		else{
			int sum=0;
			for(int i=1;i<j;i++) {
		       if(c[i]>=k){
		   	    if(c[i]%k==0) sum+=c[i];
		   	    else sum+=c[i]-(c[i]%k);
		       }
		       
	    }cout<<sum<<" ";
		}
		
	}
//	for(int i=5;i<=n;i++) cout<<0<<" ";
	
	
	return 0;
}