这道题用不到桶排序，排完序后计算一下个数就行啦
by liyanxi6 @ 2023-10-15 09:45:37
```
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a[200001],cnt=0,num=0,n;
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++){
num++;
while(a[i+1]==a[i]){
num++,i++;
}
cout<<a[i]<<" "<<num<<endl;
num=0;
}
return 0;
}
```
by liyanxi6 @ 2023-10-15 09:48:18