<p>There is a set of <code>n</code> items. You are given two integer arrays <code>values</code> and <code>labels</code> where the value and the label of the <code>i<sup>th</sup></code> element are <code>values[i]</code> and <code>labels[i]</code> respectively. You are also given two integers <code>numWanted</code> and <code>useLimit</code>.</p>
<p>Choose a subset <code>s</code> of the <code>n</code> elements such that:</p>
<ul>
<li>The size of the subset <code>s</code> is <strong>less than or equal to</strong><code>numWanted</code>.</li>
<li>There are <strong>at most</strong><code>useLimit</code> items with the same label in <code>s</code>.</li>
</ul>
<p>The <strong>score</strong> of a subset is the sum of the values in the subset.</p>
<p>Return <em>the maximum <strong>score</strong> of a subset </em><code>s</code>.</p>