Prateek loves candy... I am getting TLE

#include
#include
using namespace std;
int candy(int arr[],int n)
{ int count=0,k=0;

          for(int j=2;j<=INT_MAX;j++)
             {     if(k==n) 
                  return arr[k-1];
			    for(int i=2;i<=j;i++)
                {   if(j%i==0)
                     {  count++;
					 }
				}
				if(count==1)
				  {  arr[k++]=j;
				  }
				  count=0;
		   }

}
int main()
{ int t;
cin>>t;
while(t>0)
{
int n ;
cin>>n;
int arr[n];
cout<<candy(arr,n)<<endl;
t–;

}
}#include
#include
using namespace std;
int candy(int arr[],int n)
{ int count=0,k=0;

          for(int j=2;j<=INT_MAX;j++)
             {     if(k==n) 
                  return arr[k-1];
			    for(int i=2;i<=j;i++)
                {   if(j%i==0)
                     {  count++;
					 }
				}
				if(count==1)
				  {  arr[k++]=j;
				  }
				  count=0;
		   }

}
int main()
{ int t;
cin>>t;
while(t>0)
{
int n ;
cin>>n;
int arr[n];
cout<<candy(arr,n)<<endl;
t–;

}
}#include
#include
using namespace std;
int candy(int arr[],int n)
{ int count=0,k=0;

          for(int j=2;j<=INT_MAX;j++)
             {     if(k==n) 
                  return arr[k-1];
			    for(int i=2;i<=j;i++)
                {   if(j%i==0)
                     {  count++;
					 }
				}
				if(count==1)
				  {  arr[k++]=j;
				  }
				  count=0;
		   }

}
int main()
{ int t;
cin>>t;
while(t>0)
{
int n ;
cin>>n;
int arr[n];
cout<<candy(arr,n)<<endl;
t–;

}
}#include
#include
using namespace std;
int candy(int arr[],int n)
{ int count=0,k=0;

          for(int j=2;j<=INT_MAX;j++)
             {     if(k==n) 
                  return arr[k-1];
			    for(int i=2;i<=j;i++)
                {   if(j%i==0)
                     {  count++;
					 }
				}
				if(count==1)
				  {  arr[k++]=j;
				  }
				  count=0;
		   }

}
int main()
{ int t;
cin>>t;
while(t>0)
{
int n ;
cin>>n;
int arr[n];
cout<<candy(arr,n)<<endl;
t–;

}
}