import
java.util.Arrays;
import
java.util.Comparator;
public
class
MinimumCirclesTobeRemoved {
private
class
Circle
implements
Comparator<Circle>{
int
start;
int
end;
public
int
compare(Circle a , Circle b){
if
(a.end == b.end){
return
(a.start - b.start);
}
return
a.end - b.end;
}
}
public
void
CountCircles(
int
[] c,
int
[] r,
int
n){
Circle diameter[] =
new
Circle[n];
for
(
int
i =
0
; i < n; i++)
{
diameter[i] =
new
Circle();
diameter[i].start = (c[i] - r[i]);
diameter[i].end = (c[i] + r[i]);
}
Arrays.sort(diameter,
new
Circle());
int
count =
0
;
int
curr = diameter[
0
].end;
for
(
int
i =
1
; i < n; i++)
{
if
(diameter[i].start > curr)
{
curr = diameter[i].end;
}
else
{
count++;
}
}
System.out.println(count);
}
public
static
void
main(String[] args)
{
MinimumCirclesTobeRemoved a =
new
MinimumCirclesTobeRemoved();
int
[] c =
new
int
[]{
1
,
2
,
3
,
4
};
int
[] r =
new
int
[]{
1
,
1
,
1
,
1
};
a.CountCircles(c, r, c.length);
}
}