add 1090

Author: luliyucoordinate

README.md

@@ -420,4 +420,5 @@ LeetCode
 |1085|[Sum of Digits in the Minimum Number](https://leetcode.com/contest/biweekly-contest-2/problems/sum-of-digits-in-the-minimum-number/) | c | [c++](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.cpp) |[python](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.py)|||Easy|
 |1086|[High Five](https://leetcode.com/contest/biweekly-contest-2/problems/high-five/) | c | [c++](./src/1086-High-Five/1086.cpp) |[python](./src/1086-High-Five/1086.py)|||Easy|
 |1087|[Brace Expansion](https://leetcode.com/contest/biweekly-contest-2/problems/brace-expansion/) | c | [c++](./src/1087-Brace-Expansion/1087.cpp) |[python](./src/1087-Brace-Expansion/1087.py)|||Medium|
-|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | c | [c++](./src/1089-Duplicate-Zeros/1089.cpp) |[python](./src/1089-Duplicate-Zeros/1089.py)|||Easy|
+|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | c | [c++](./src/1089-Duplicate-Zeros/1089.cpp) |[python](./src/1089-Duplicate-Zeros/1089.py)|||Easy|
+|1090|[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/) | c | [c++](./src/1090-Largest-Values-From-Labels/1090.cpp) |[python](./src/1090-Largest-Values-From-Labels/1090.py)|||Medium|

src/1090-Largest-Values-From-Labels/1090.cpp

@@ -0,0 +1,17 @@
+class Solution 
+{
+public:
+    int largestValsFromLabels(vector<int>& values, vector<int>& labels, int num_wanted, int use_limit) 
+    {
+        int n = values.size(), res = 0, counts[20001] = {0};
+        vector<pair<int, int>> items;
+        for (int i = 0; i < n; i++) items.push_back({values[i], labels[i]});
+        sort(items.rbegin(), items.rend());
+        for (int i = 0; i < n and num_wanted > 0; i++)
+        {
+            if (counts[items[i].second] < use_limit)
+                res += items[i].first, counts[items[i].second]++, num_wanted--;
+        }  
+        return res;
+    }
+};

src/1090-Largest-Values-From-Labels/1090.py

@@ -0,0 +1,17 @@
+from collections import defaultdict
+class Solution:
+    def largestValsFromLabels(self, values: List[int], labels: List[int], num_wanted: int, use_limit: int) -> int:
+        n, data = len(values), list()
+        for i in range(n):
+            data.append([values[i], labels[i]])
+        data.sort(reverse=True)
+        
+        cnts, res = defaultdict(int), 0
+        for i in range(n):
+            if num_wanted == 0:
+                break
+            if cnts[data[i][1]] < use_limit:
+                res += data[i][0]
+                cnts[data[i][1]] += 1
+                num_wanted -= 1
+        return res