Minimum Initial Energy to Finish Tasks LeetCode solution in Java

1
import java.util.*;
2

3
class Solution {
4
  public int minimumEffort(int[][] tasks) {
5
    Arrays.sort(
6
        tasks,
7
        new Comparator<int[]>() {
8
          @Override
9
          public int compare(int[] a, int[] b) {
10
            return (b[1] - b[0]) - (a[1] - a[0]);
11
          }
12
        });
13
    int sum = 0, max = 0;
14
    for (int i = 0; i < tasks.length; i++) {
15
      max = Math.max(max, sum + tasks[i][1]);
16
      sum += tasks[i][0];
17
    }
18

19
    return max;
20
  }
21
}