全RE求调

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
    vector<int> v;
    for(int i=0;i<n;i++){
        int a;
        cin>>a;
        v.push_back(a);
    }
    sort(v.begin(),v.end());
    int cnt = 1;
    for(int i=0;i<n-1;i++){
        if(v[i+1]==v[i]){
            cnt++;
        }
        else{
            cout<<v[i]<<" "<<cnt<<endl;
            cnt = 1;
        }
    }
    cout<<v[n-1]<<" "<<cnt<<endl;
    return 0;
}