题解 | #合并表记录#
合并表记录
https://www.nowcoder.com/practice/de044e89123f4a7482bd2b214a685201
#include <iostream>
#include "map"
using namespace std;
int main() {
map<int, int> m;
int n;
cin >> n;
int a,b;
while (cin >> a >> b) { // 注意 while 处理多个 case
if (m.find(a) != m.end()) {
m[a] += b;
} else {
m[a] = b;
}
}
map<int, int>::iterator it;
for (it = m.begin(); it != m.end(); it++) {
cout << it->first << " " << it->second << endl;
}
}
// 64 位输出请用 printf("%lld")
查看17道真题和解析