<p>You are given an array of strings <code>words</code> and a string <code>chars</code>.</p>

<p>A string is <strong>good</strong> if it can be formed by characters from <code>chars</code> (each character can only be used once).</p>

<p>Return <em>the sum of lengths of all good strings in words</em>.</p>

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

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;bt&quot;,&quot;hat&quot;,&quot;tree&quot;], chars = &quot;atach&quot;
<strong>Output:</strong> 6
<strong>Explanation:</strong> The strings that can be formed are &quot;cat&quot; and &quot;hat&quot; so the answer is 3 + 3 = 6.
</pre>

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

<pre>
<strong>Input:</strong> words = [&quot;hello&quot;,&quot;world&quot;,&quot;leetcode&quot;], chars = &quot;welldonehoneyr&quot;
<strong>Output:</strong> 10
<strong>Explanation:</strong> The strings that can be formed are &quot;hello&quot; and &quot;world&quot; so the answer is 5 + 5 = 10.
</pre>

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

<ul>
	<li><code>1 &lt;= words.length &lt;= 1000</code></li>
	<li><code>1 &lt;= words[i].length, chars.length &lt;= 100</code></li>
	<li><code>words[i]</code> and <code>chars</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool check(vector<int> ss, vector<int> s){
        for(int i = 0; i < ss.size(); i++){
            if(s[i] > ss[i]) return false;
        }
        return true;
    }
    int countCharacters(vector<string>& w, string s) {
        int ans = 0;
        vector<int> cnt(26, 0);
        for(int i = 0; i < s.size(); i++) cnt[(int)(s[i] - 'a')] += 1;
        for(int i = 0; i < w.size(); i++){
            vector<int> ch(26, 0);
            for(int j = 0; j < w[i].size(); j++) ch[(int)(w[i][j] - 'a')] += 1;
            if(check(cnt, ch)) ans += w[i].size();
        }
        return ans;
    }
};
34424