样例过，全RE了！

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
long long n,gs;
long long a[maxn],sl[maxn];
int 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++){
        sl[a[i]]++;
        gs++;
    }
    for (int i = 1;i<=gs;i++){
    	if (a[i]!=a[i+1]){
			cout<<a[i]<<" "<<sl[a[i]]<<endl;
		}
        
    }
    return 0;
}