1 Testcase is Failing, can anyone help out with what's missing in this?

#1

#include<bits/stdc++.h>
using namespace std;

int main()
{
long long n; cin>>n;
long long centres[n],radii[n];
for(long long i=0;i<n;i++)
{
cin>>centres[i];
cin>>radii[i];
}
long long minRemoval=0;
long long prevCircleEnd=centres[0]+radii[0],newCircleBegin;
for(long long i=1;i<n;i++)
{
newCircleBegin=centres[i]-radii[i];
if(newCircleBegin>=prevCircleEnd)
{
prevCircleEnd=centres[i]+radii[i];
}
else
{
minRemoval++;
}
}
cout<<minRemoval<<endl;
}

#2

#include<bits/stdc++.h> using namespace std; int main() { long long n; cin>>n; long long centres[n],radii[n]; for(long long i=0;i<n;i++) { cin>>centres[i]; cin>>radii[i]; } long long minRemoval=0; long long prevCircleEnd=centres[0]+radii[0],newCircleBegin; for(long long i=1;i<n;i++) { newCircleBegin=centres[i]-radii[i]; if(newCircleBegin>=prevCircleEnd) { prevCircleEnd=centres[i]+radii[i]; } else { minRemoval++; } } cout<<minRemoval<<endl; }

#3

@abhyuday.dixit Please save your code on ide.codingblocks.com and then share its link. It is easy for us to debug then.
For this question, I suggest you watch the lecture on Greedy Algorithms first. This problem is very similar to the Activity Selection problem explained in that lecture. Please watch that question first. You may get your mistake after watching that.