习题8-2 聚会游戏（Party Games, Mid－Atlantic 2012, UVa1610）

思路：
构造题，挫败感max。orz。。。。
容易想到ans为sort后中间两个字符串a，b之间的串。
由于要求长度以及字典序最小，可以按照这两个来枚举构造。
若某长度无解，则ans加上a串的当前字符。

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define SFFFF(a, b, c, d) scanf("%d%d%d%d", &a, &b, &c, &d)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) (int)(a).size()
#define PB push_back
#define LL long long
#define mod 10007
#define inf 100000007
#define eps 1e-12
using namespace std;
int buf[20];
int read() {
	int x = 0; char ch = getchar(); bool f = 0;
	while (ch < '0' || ch > '9') { if (ch == '-') f = 1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}
void write(int x) {
	if (!x) { putchar(48); return; }
	int l = 0; if (x < 0) putchar('-'), x = -x;
	while (x) buf[++l] = x % 10, x = x / 10;
	while (l) putchar(buf[l--] + 48);
}
//-------------------------chc------------------------------//
int main() {
	int n;
	while (cin >> n && n) {
		vector<string> v;
		string s;
		FOR(i, 0, n) cin >> s, v.push_back(s);
		sort(v.begin(), v.end());
		string a = v[n / 2 - 1], b = v[n / 2];
		string ans;
		bool ok = false;
		int idx = 0;
		while (1) {
			FOR(i, 0, 26) {
				string temp = ans + (char)('A' + i);
				if (a <= temp && temp < b) {
					ok = true;
					ans = temp;
					break;
				}
			}
			if (ok) break;
			else ans += a[idx++];
		}
		cout << ans << endl;
	}
	return 0;
}