按照给出的单词，拼出一个与所有单词不同的单词。不能与原单词重复，必须是字典序最小，且只能从当前列中取

 

此题略难，没有ac，只有70%，先放在这里。 

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;
	vector<string> v1(n);
	for (int i = 0; i < v1.size(); i++)
	{
		cin >> v1[i];
	}
	vector<string> v2(m, string(n, ' '));
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			v2[i][j] = v1[j][i];
		}
	}
	string result(m, ' ');
	for (int i = 0; i < m; i++)
	{
		string& v = v2[i];
		sort(v.begin(), v.end());
	}

	for (int i = 0; i<m; i++) {
		result[i] = v2[i][0];
	}
	int flag = 0;
	for (int i = 0; i < n; i++)
	{
		if (v1[i] == result)
		{
			flag = 1;
		}
	}
	if (flag) {
		for (int i = m - 1; i >= 0; i--) {
			for (int j = 0; j<n; j++) {
				if (v2[i][j] != v2[i][0]) {
					result[i] = v2[i][j];
					flag = 0;
					break;
				}
			}
			if (!flag) break;
		}
	}
	if (flag)
	{
		cout << '-';
	}
	else
	{
		cout << result;
	}
	return 0;
}