rt.桶排为什么会超时

#include<bits/stdc++.h>
using namespace std;
int h[200005];
int main(){
	int n,m,x;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i){
		scanf("%d",&x);
		h[x]++;
		int ans=-1,aaa=-1;
		for(int i=1;i<=n;++i){
			if(h[i]>aaa){
				ans=i;
				aaa=h[i];
			} 
		}cout<<ans<<endl;
	}
    return 0;
}