<p>Given a list of <code>words</code>, list of&nbsp; single&nbsp;<code>letters</code> (might be repeating)&nbsp;and <code>score</code>&nbsp;of every character.</p>

<p>Return the maximum score of <strong>any</strong> valid set of words formed by using the given letters (<code>words[i]</code> cannot be used two&nbsp;or more times).</p>

<p>It is not necessary to use all characters in <code>letters</code> and each letter can only be used once. Score of letters&nbsp;<code>&#39;a&#39;</code>, <code>&#39;b&#39;</code>, <code>&#39;c&#39;</code>, ... ,<code>&#39;z&#39;</code> is given by&nbsp;<code>score[0]</code>, <code>score[1]</code>, ... , <code>score[25]</code> respectively.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;dog&quot;,&quot;cat&quot;,&quot;dad&quot;,&quot;good&quot;], letters = [&quot;a&quot;,&quot;a&quot;,&quot;c&quot;,&quot;d&quot;,&quot;d&quot;,&quot;d&quot;,&quot;g&quot;,&quot;o&quot;,&quot;o&quot;], score = [1,0,9,5,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0]
<strong>Output:</strong> 23
<strong>Explanation:</strong>
Score  a=1, c=9, d=5, g=3, o=2
Given letters, we can form the words &quot;dad&quot; (5+1+5) and &quot;good&quot; (3+2+2+5) with a score of 23.
Words &quot;dad&quot; and &quot;dog&quot; only get a score of 21.</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;xxxz&quot;,&quot;ax&quot;,&quot;bx&quot;,&quot;cx&quot;], letters = [&quot;z&quot;,&quot;a&quot;,&quot;b&quot;,&quot;c&quot;,&quot;x&quot;,&quot;x&quot;,&quot;x&quot;], score = [4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,10]
<strong>Output:</strong> 27
<strong>Explanation:</strong>
Score  a=4, b=4, c=4, x=5, z=10
Given letters, we can form the words &quot;ax&quot; (4+5), &quot;bx&quot; (4+5) and &quot;cx&quot; (4+5) with a score of 27.
Word &quot;xxxz&quot; only get a score of 25.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;leetcode&quot;], letters = [&quot;l&quot;,&quot;e&quot;,&quot;t&quot;,&quot;c&quot;,&quot;o&quot;,&quot;d&quot;], score = [0,0,1,1,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0]
<strong>Output:</strong> 0
<strong>Explanation:</strong>
Letter &quot;e&quot; can only be used once.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 14</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 15</code></li>
	<li><code>1 &lt;= letters.length &lt;= 100</code></li>
	<li><code>letters[i].length == 1</code></li>
	<li><code>score.length ==&nbsp;26</code></li>
	<li><code>0 &lt;= score[i] &lt;= 10</code></li>
	<li><code>words[i]</code>, <code>letters[i]</code>&nbsp;contains only lower case English letters.</li>
</ul>

class Solution {
public:
    set<vector<string> > solve(vector<string>& v)
    {
        // To store the resulting subsets
        set<vector<string> > res;
        vector<string> subset;
        vector<vector<string> > result;

        // Insert it into the resultant vector
        res.insert(subset);

        // Iterate over all elements
        for (int i = 0; i < v.size(); i++) {
            int N = res.size();
            for (auto it = res.begin();
                it != res.end() and N > 0; it++) {

                // Iterate through every subset
                // generated till now and inset
                // the current element in the
                // end of it
                subset = *it;
                subset.push_back(v[i]);
                result.push_back(subset);
                N--;
            }
            res.insert(result.begin(), result.end());
            result.clear();
        }

        return res;
    }

    bool checkLetters(vector<char>& letters, string s) {

        vector<char>::iterator it;
        vector<char>  _letters = letters; //Паранойя, чтобы не зашкварить список
        for (char c: s) {
            it = find(_letters.begin(),_letters.end(),c) ;
            if (it !=  _letters.end()) {
                _letters.erase(it);
            } else {
                return false;
            }
        }
        return true;
    }
    int calcScore(vector<int>& score, string s) {
        int res = 0;
        for (char c: s) {
            cout << c << " " << c -97 << " " << score[c-97] << endl; 
            res+=score[c-97];
        }
        return res;
    }
    int maxScoreWords(vector<string>& words, vector<char>& letters, vector<int>& score) {
        int maxScore = 0;
        //Создать
        set<vector<string>> allWords = solve(words);
        vector<string> all;
        for (vector<string> aWord: allWords) {
            string r = "";
            for (string a: aWord) r = r + a;
            all.push_back(r);
        }
        for (string word: all) {
            if (checkLetters(letters,word)) {
                int currScore = calcScore(score,word);
                cout << word << " " << currScore << endl;
                if (currScore > maxScore) maxScore = currScore;
            }
        }
        return maxScore;

    }
};
100506