Nimionese

input/code.cpp: In function 'int main()':
input/code.cpp:87:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < word.length(); ++i)
                     ^
input/code.cpp:97:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 1; i < syb.size(); ++i)
                     ^
input/code.cpp:99:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int a = 0; a < syb[i].length(); ++a)
                      ^

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <unordered_set>
using namespace std;

unordered_set<char> hard    = {'b','c','d','g','k','n','p','t'};
unordered_set<char> hard_up = {'B','C','D','G','K','N','P','T'};

bool iscap(char c){return c < 'a';}
bool ishard(char c){return hard.count(c) || hard_up.count(c); }
char nearest_hard(char c)
{
	int mind = 1000;
	bool tie = false;
	char tiechar = 127;
	char minchar = 127;
	
	const auto& vec = iscap(c) ? hard_up : hard;

	for (char t: vec)
	{
		int d = abs(int(c)-int(t));
		if (d == mind)
		{
			tie = true;
			tiechar = min(t, tiechar);
		}
		else if (d < mind)
		{
			tie = false;
			mind = d;
			minchar = t;
			tiechar = 127;
		}
	}
	if (tie)
		return tiechar;
	else
		return minchar;
}

string nearest_end(char c)
{
	int mind = 1000;
	bool tie = false;
	char tiechar = 127;
	char minchar = 127;
	
	vector<char> vec = {'a','o','u'};

	for (char t: vec)
	{
		int d = abs(int(c)-int(t));
		if (d == mind)
		{
			tie = true;
			tiechar = min(t, tiechar);
		}
		else if (d < mind)
		{
			tie = false;
			mind = d;
			minchar = t;
			tiechar = 127;
		}
	}
	if (tie)
		return string() + tiechar + "h";
	else
		return string() + minchar + "h";
}

int main()
{
	string word;
	while(cin>>word)
	{
		if (!cin)break;
		//
		word[0] = nearest_hard(word[0]);
		
		
		// loop syllables
		vector<string> syb(1);
		for (int i = 0; i < word.length(); ++i)
		{
			char c = word[i];
			if (c == '-')
				syb.push_back(string());
			else
				syb.back() += c;			
		}
		
		word = syb[0];
		for (int i = 1; i < syb.size(); ++i)
		{
			for (int a = 0; a < syb[i].length(); ++a)
			{
				if (ishard(syb[i][a]))
				{
					bool cap = iscap(syb[i][a]);
					syb[i][a] = std::tolower(syb[0][0]);
					if (cap)
						syb[i][a] = std::toupper(syb[0][0]);
				}
			}
			word += syb[i];
		}
		//
		if (ishard(word[word.length()-1]))
		{
			word += nearest_end(word[word.length()-1]);
		}
			
		cout << word << " ";
	}
	cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED