题解 | #合并表记录#

#include #include #include #include

using namespace std;

bool compare(pair<int,int> a, pair<int,int> b){ return a.first<b.first; }

int main(void) {

int n;
cin >> n;
if(n<=0) return 0;
int index, value;
vector<pair<int, int>> data; 
while (n--){
    cin >> index >> value;
    data.push_back(make_pair(index, value));
    
    for (int i = 0; i< int(data.size())-1; i++){
        if(data[i].first == index){
            data[i].second+=value;
            data.pop_back();
            break;
        }
    }
}

stable_sort(data.begin(), data.end());
for (int j=0;j<int(data.size());j++){
    cout << data[j].first << " " << data[j].second << endl;
}


return 0;

}