-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
1090.java
27 lines (26 loc) · 1019 Bytes
/
1090.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
__________________________________________________________________________________________________
class Solution {
public int largestValsFromLabels(int[] v, int[] l, int n, int u) {
int[][] arr=new int[v.length][2];
for(int i=0;i<arr.length;i++){
arr[i][0]=v[i];arr[i][1]=l[i];
}
Arrays.sort(arr,(a,b)->-a[0]+b[0]);
Map<Integer,Integer> map=new HashMap<>();
for(int i=0;i<arr.length;i++){
if(!map.containsKey(arr[i][1]))map.put(arr[i][1],0);
}
int total=0;
for(int i=0;i<arr.length;i++){
if(n==0)break;
if(map.get(arr[i][1])<u){
map.put(arr[i][1],map.get(arr[i][1])+1);
total+=arr[i][0];
n--;
}
}
return total;
}
}
__________________________________________________________________________________________________
__________________________________________________________________________________________________