另一种方法题解，比较麻烦，但是容易理解

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> shou;
vector<int> zhi;
vector<int> zhong;

int main(){
    int n;
    cin>>n;

    for(int i=0;i<n;i++){
        int sh;
        cin>>sh;
        shou.push_back(sh);
    }

    for(int i=0;i<n;i++){
        int zh;
        cin>>zh;
        zhi.push_back(zh);
    }

    for(int i=0;i<n;i++){
        int cnt = shou[i] - zhi[i];
        zhong.push_back(cnt);
    }

    sort(zhong.begin(),zhong.end());

    int count = zhong[0];
    int cot = 1;
    for(int i=1;i<n;i++){
        if(count==zhong[i]){
            cot++;
        }else{
            cout<<count<<" "<<cot<<endl;
            count = zhong[i];
            cot = 1;
        }
    }
    cout<<count<<" "<<cot;
    return 0;
}