Greedy, Min heap, PriorityQueue1
2
3
4
5
6
7
8
9
10
11
12
13
14
15class Solution {
public int connectSticks(int[] sticks) {
PriorityQueue<Integer> q=new PriorityQueue<>();
for(int i:sticks) q.offer(i);
int res=0;
while(q.size()>1){
int a=q.poll();
int b=q.poll();
int sum=a+b;
res+=sum;
q.offer(sum);
}
return res;
}
}