题解

#include <bits/stdc++.h>
using namespace std;

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

    vector<int> income(n);
    for (int i = 0; i < n; i++) {
        cin >> income[i];
    }

    vector<int> ex(n);
    for (int i = 0; i < n; i++) {
        cin >> ex[i];
    }

    unordered_map<int, int> profitCount;
    for (int i = 0; i < n; i++) {
        int profit = income[i] - ex[i];
        profitCount[profit]++;
    }
    
    vector<pair<int, int>> sortedProfitCount;
    for (auto it = profitCount.begin(); it != profitCount.end(); ++it) {
        sortedProfitCount.push_back(make_pair(it->first, it->second));
    }
    
    sort(sortedProfitCount.begin(), sortedProfitCount.end());
    
    for (const auto& p : sortedProfitCount) {
        cout << p.first << " " << p.second << endl;
    }

    return 0;
}

英语