class Solution {
public int minimumEffort(int[][] tasks) {
Arrays.sort(tasks, (int[] a, int[] b) -> {
return (b[1] - b[0]) - (a[1] - a[0]);
});
int ans = 0;
int sum = 0;
for (int[] task : tasks) {
ans = Math.max(sum + task[1], ans);
sum += task[0];
}
return ans;
}
}