# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1255860 | vampirr | Advertisement 2 (JOI23_ho_t2) | Java | 0 ms | 0 KiB |
import java.util.*;
public class joi23_ho_t2 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
ArrayList<int[]> v = new ArrayList<>();
for (int i = 0; i < n; i++) {
int a = in.nextInt();
int b = in.nextInt();
v.add(new int[] {a-b, b+a});
}
v.sort((p1, p2) -> {
if (p1[0] != p2[0])
return Integer.compare(p1[0], p2[0]);
return Integer.compare(p2[1], p1[1]); // descending second
});
int cnt = 0;
int current = -1;
for (int[] p : v) {
if (current < p[1]) {
cnt++;
current = p[1];
}
}
System.out.println(cnt);
in.close();
}
}