A city street is represented by integer positions on a number line. The cameras are represented by a 2D integer array cameras, where cameras[i]= [position_i, range_i] means that a camera at $p os i t i o n_{i}$ monitors every integer position in the inclusive interval [position_i - range_i, position_i + range_i].

The surveillance level at position p is defined as the number of cameras that monitor position p .

Given cameras, return the position on the street with the highest surveillance level. If multiple positions have the highest surveillance level, return the smallest one.

Example 1:

Input: cameras = [[2, 3], [5, 2], [8, 1], [4, 1]]
Output: 3

Explanation:
Camera at 2 with range 3 → Covers integer positions from -1 through 5
Camera at 5 with range 2 → Covers integer positions from 3 through 7
Camera at 8 with range 1 → Covers integer positions from 7 through 9
Camera at 4 with range 1 → Covers integer positions from 3 through 5

Surveillance Level Calculation: Count how many cameras cover each position.

Position	Covered By Cameras at $p os i t i o n_{i}$	Surveillance Level
-1	`2`	1
0	`2`	1
1	`2`	1
2	`2`	1
3	`2, 4, 5`	3
4	`2, 4, 5`	3
5	`2, 4, 5`	3
6	`5`	1
7	`5, 8`	2
8	`8`	1
9	`8`	1

Example 2:

Input: cameras = [[-5, 3], [0, 2], [4, 1]]
Output: -2

Explanation:
Camera at -5 with range 3 → Covers integer positions from -8 through -2
Camera at 0 with range 2 → Covers integer positions from -2 through 2
Camera at 4 with range 1 → Covers integer positions from 3 through 5

The highest surveillance level is 2.
Only position -2 is covered by both the cameras at -5 and 0.
Therefore, -2 is returned.

Position	Covered By Cameras	Surveillance Level
-8	`-5`	1
-7	`-5`	1
-6	`-5`	1
-5	`-5`	1
-4	`-5`	1
-3	`-5`	1
-2	`-5, 0`	2
-1	`0`	1
0	`0`	1
1	`0`	1
2	`0`	1
3	`4`	1
4	`4`	1
5	`4`	1

Example 3:

Input: cameras = [[1, 0], [0, 1]]
Output: 1

Explanation:
Camera at 1 with range 0 → Covers position [1 to 1]
Camera at 0 with range 1 → Covers positions [-1 to 1]

The highest surveillance level is 2.
The only position covered by both cameras is 1. Therefore, the output is 1.

Position	Covered By Cameras at $p os i t i o n_{i}$	Coverage (Number of Cameras)
-1	`0`	1
0	`0`	1
1	`0`, `1`	2

Constraints:

1 <= cameras.length <= 10⁵

cameras[i].length == 2

−10⁸ <= position_i <= 10⁸

0 <= range_i <= 10⁸

96. Position with Maximum Camera Coverage