Testcases are not running pls check
Your approach is not correct.
You can follow this approach
Take in input the centers and radii of the circles. Find the leftmost and rightmost points of these circles by
left = c[i] - r[i];
right = c[i] + r[i];
Store these left and right as a pair and sort this array of pairs in increasing order of right. Then run the greedy algo.
You can refer this code https://ide.codingblocks.com/s/259789