合并表记录

数据表记录包含表索引和数值，请对表索引相同的记录进行合并，即将相同索引的数值进行求和运算，输出按照key值升序进行输出。以下分别用c++、Java、Python实现：
C++代码：

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
void solution(vector<vector<int>> v){
    map<int, int> hash;
    vector<int> re;
    for(int i=0; i<v.size(); i++){
        if(hash[v[i][0]]==0)
            re.push_back(v[i][0]);
        hash[v[i][0]]+=v[i][1];
    }
    sort(re.begin(),re.end());
    for(int i=0; i<re.size(); i++)
        cout<<re[i]<<" "<<hash[re[i]]<<endl;
}
int main(){
    int n,index,value;
    vector<vector<int>> v;
    while(cin>>n){
        for(int i=0; i<n; i++){
            vector<int> init;
            cin>>index>>value;
            init.push_back(index);
            init.push_back(value);
            v.push_back(init);
            init.clear();
        }
        solution(v);
        v.clear();
    }
    return 0;
}

Java代码

import java.util.Scanner;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;
public class Main {
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        while(sc.hasNext()){
            int n=sc.nextInt();
            Map<Integer,Integer> map=new TreeMap<Integer,Integer>();//红黑树map按键排序存储
            for (int i=0; i<n; i++){
                int key=sc.nextInt();
                int value=sc.nextInt();
                if (map.containsKey(key))
                    map.put(key,map.get(key)+value);                
                else
                    map.put(key, value);
            }
            for (Entry<Integer, Integer> m :map.entrySet())//循环遍历
                System.out.println(m.getKey()+" "+m.getValue());             
        }
    }
}

Python代码：

# coding=utf-8
while True:
    try:
        ss = {}
        n = int(raw_input())
        for i in range(n):
            s1 = map(int,raw_input().split())
            if ss.has_key(s1[0]):
                ss[s1[0]] = ss[s1[0]] + s1[1]
            else:
                ss[s1[0]] = s1[1]
        ss = sorted(ss.items(), key=lambda d: d[0])
        for key in ss:
            print key[0], key[1]
    except:
        break