习题8-2(uva-1610)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e3 + 7;
string input[maxn];
int n;

int main()
{
    
    
	while (cin >> n && n) {
    
    
		for (int i = 0; i < n; i++) cin >> input[i];
		sort(input, input + n);
		string left = input[n / 2 - 1], right = input[n / 2 ],ans = "";
		int len = left.size(),len2 = len - 1;
		for (int i = 0; i < len; i++) {
    
    
			int tmp = left[i] + 1;
			if (tmp <= 'Z' && i < len2) {
    
    
				ans.push_back(tmp);
				if(ans < right) break;
				ans.back()--;
			}
			else ans.push_back(left[i]);
		}
		cout << ans << endl;
	}
	return 0;
}