Solução: Problema da palavra mágica (Marco Antonio)

#include <iostream>
#include <string>
#include <algorithm>
 
using namespace std;
 
bool compare(char chara, char charb)
{
	return (chara < charb);
}
 
int main()
{
	string entry, word;
 
	cin >> entry;
	if (entry.length() % 2 == 0)
	{
		word = entry.substr(0, (entry.length()/2));
		entry = entry.substr(entry.length()/2, entry.length());
		sort(word.begin(),word.end(),compare);
		if (!(entry.compare(word)))
		{
			cout << "S" << endl;
			return 1;
		}
	}
	cout << 'N' << endl;
	return 0;
}