题解 | #合并表记录#
合并表记录
https://www.nowcoder.com/practice/de044e89123f4a7482bd2b214a685201
#include <iostream> #include "map" using namespace std; int main() { map<int, int> mapNUm; int i; cin >> i; while (i-- != 0) { int a; int b; cin >> a >> b; auto it = mapNUm.find(a); if (it != mapNUm.end()) { mapNUm[a] = mapNUm[a] + b; } else { mapNUm[a] = b; } } for (auto i : mapNUm) { cout << i.first << " " << i.second << endl; } } // 64 位输出请用 printf("%lld")