Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
HERE:
	for {
		max := 0
		shop := 'A'
		for i := 0; i < 5; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf[0])
			b, _ := strconv.Atoi(buf[1])
			if a == 0 {
				break HERE
			}
			if max < a + b {
				max = a + b
				shop = 'A' + int32(i)
			}
		}
		fmt.Println(string(shop), max)
	}
}

C++: #include <cassert>
//PXjUXeZStdX
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
//#define INF 1e9
#define LINF (1LL<<40)
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
typedef pair<int,int> P;

const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}

template<typename T> 
void print(vector<T> v){
    for(int i=0;i<v.size();i++){
        if(i)cout<<" ";
        cout<<v[i];
    }
    cout<<endl;
}
int INF=1e18;

template<typename T>
void printendl(vector<T> v){
    for(auto date:v)cout<<date<<endl;
}

template<typename T>
void printvv(vector<vector<T>> v){
    for(int i=0;i<v.size();i++){
        for(int j=0;j<v[i].size();j++){
            if(j)cout<<" ";
            cout<<v[i][j];
        }
        cout<<endl;
    }
}

int gcd(int a,int b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    else return gcd(b,a%b);
}

int powl(int n,int p){
    int ret=1;
    for(int i=0;i<p;i++)ret*=n;
    return ret;
}

struct Edge{
    int to,cost;
};

struct S{
    char c;
    int num;
};
signed main (){
    int a,b;
    while(cin>>a>>b){
        if(a+b==0)break;
        vector<S> v(5);
        v[0].num=a+b;
        v[0].c='A';
        rep(i,1,5){
            int a,b;
            cin>>a>>b;
            v[i].num=a+b;
            v[i].c='A'+i;
        }
        sort(all(v),[&](S a,S b){
            return a.num>b.num;
        });
        cout<<v[0].c<<" "<<v[0].num<<endl;
    }
    

    

    


}

/*

*/

C++: #include<iostream>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)

main(){
  int ans,t,a,b;
  while(cin>>a>>b){
    if ( a == 0 && b == 0)break;
    ans=a;b;
    t=0;
    REP(i,1,5){
      cin>>a>>b;
      if ( a+b>ans){ans=a+b;t=i;}
    }
    cout << (char)(t+'A')<<" " << ans << endl;
  }
}

C++: #include<stdio.h>
int main(void)
{
    char str[7] = { "\nABCDE" };
    int i, s1[6], s2[6], temp[6], max[6];
        for (i = 1; i <= 5; i++) {
            scanf("%d %d", &s1[i], &s2[i]);
            temp[i] = s1[i] + s2[i];
            if (s1[1] <= 0 && s2[1] <= 0) {
                break;
                
            }

        }
        while (s1[1] > 0 && s2[1] > 0) {

            for (i = 1; i <= 5; i++) {
                if (temp[i] > max[1]) {
                    max[2] = max[1];
                    max[1] = temp[i];
                }
                else if (temp[i] > max[2]) {
                    max[3] = max[2];
                    max[2] = temp[i];
                }
                else if (temp[i] > max[3]) {
                    max[4] = max[3];
                    max[3] = temp[i];
                }
                else if (temp[i] > max[4]) {
                    max[5] = max[4];
                    max[4] = temp[i];
                }
                else {
                    max[5] = temp[i];
                }
            }

            for (i = 1; i <= 5; i++) {
                if (max[1] == temp[i]) {
                    printf("%c %d\n", str[i], temp[i]);
                }

            }
            for (i = 1; i <= 5; i++) {
                scanf("%d %d", &s1[i], &s2[i]);
                temp[i] = s1[i] + s2[i];
                if (s1[1] <= 0 && s2[1] <= 0) {
                    break;
                }
            }
        }
    
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(void){
	int a,b;
	while(1){
		int max=-1;
		char c[5];
		c[0]= 'A';
		c[1]= 'B';
		c[2]= 'C';
		c[3]= 'D';
		c[4]= 'E';
		int maxchar=0;
		
		for(int i=0;i<5;i++){
					cin >> a >> b;
			if(a == 0  && b == 0) break;
			else if(max < a+b){
				max =a+b;
				maxchar=i;
			}
		}
			if(a == 0 && b ==0) break;
		cout << c[maxchar] << " " << max <<endl;
				
	}
		
		}