We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Luck Balance
  5. Discussions

Luck Balance

  • csaiml1a_2311553
     + 0 comments

    public static int luckBalance(int k, List> contests) { PriorityQueue que = new PriorityQueue<>(); // min-heap int sum = 0;

    for (int i = 0; i < contests.size(); i++) {
    int l = contests.get(i).get(0);
    int imp = contests.get(i).get(1);
    if (imp == 1) {
        que.add(l);
    } else {
        sum += l; 
    }
}
while (que.size() > k) {
    sum -= que.poll(); 
}
while (!que.isEmpty()) {
    sum += que.poll();
}
return sum;

}