题解 | #合并表记录#
合并表记录
http://www.nowcoder.com/practice/de044e89123f4a7482bd2b214a685201
C++
#include<iostream> #include<map> using namespace std; int main() { int num; cin>>num; int key; int value; map<int,int> mp; while(num--) { cin>>key; cin>>value; if(mp.find(key)!=mp.end())mp[key] += value; else mp[key] = value; } for(auto i = mp.begin();i!=mp.end();++i) { cout<<(*i).first <<" "<<(*i).second<<endl; } return 0; }