TLE in ARRANGE

[lucckygeek]

trying to solve arrange ..https://www.spoj.pl/problems/ARRANGE/

please tell why is it that it is giving TLE

[lucckygeek]

please tell why am i getting tle
as i am doing sorted insert and chek for conditions when 1 appears and special condition for input (2 ,3 )and (1,2,3)

#include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	for(int i=0;i<t;i++)
	{
		int num;
		scanf("%d",&num);
		long int arr[num];
		int ind=1;
		for(int i=0;i<num;i++)
		{
			int a;
			scanf("%d",&a);
			int j=0;
			if(a==1)
			{
				arr[num-ind]=1;
				ind++;
			}
			else
			{
				j=i-ind;
				for(;j>=0;j--)
				{	
					if(arr[j]>a)
					{
						arr[j+1]=arr[j];
					}
					else
					{
						arr[j+1]=a;
						break;
					}
				}
				if(j==-1)
				{
					arr[0]=a;
				}
			}
		}
		int k=0;
		if(num==2)
		{
			if(arr[k]==2)
			{
				if(arr[k+1]==3)
				{
					arr[k]=3;
					arr[k+1]=2;
				}
			}
		}	
		if(num==3)
		{
			if(arr[2]==1)
			{
				if(arr[k]==2)
				{
					if(arr[k+1]==3)
					{
						arr[k]=3;
						arr[k+1]=2;
					}
				}
			}
		}
		for(int j=num-1;j>=0;j--)
		{
			printf("%ld ",arr[j]);
		}
		printf("\n");
	}
}

[leppyr64]

Your sort has a complexity of O(n^2). n can be 10^5. The built in sort is much more efficient.

[shivendramnnit]

#include<stdio.h>
void mergesort(long long int a[], long long int low, long long int high);
void merge(long long int a[], long long int low, long long int high, long long int mid);
void mergesort(long long int a[], long long int low, long long int high)
{
long long int mid;
if(low<high)
{
mid=(low+high)/2;
mergesort(a,low,mid);
mergesort(a,mid+1,high);
merge(a,low,high,mid);
}
}
void merge(long long int a[], long long int low, long long int high, long long int mid)
{
long long int i, j, k, c[50];
i=low;
j=mid+1;
k=low;
while((i<=mid)&&(j<=high))
{
if(a[i]<a[j])
{
c[k]=a[i];
k++;
i++;
}
else
{
c[k]=a[j];
k++;
j++;
}
}
while(i<=mid)
{
c[k]=a[i];
k++;
i++;
}
while(j<=high)
{
c[k]=a[j];
k++;
j++;
}
for(i=low;i<k;i++)
{
a[i]=c[i];
}
} 
int main()
   {long long int a[1000000],b,k,ni,i,j,flag1=1,flag2=1;
    scanf("%lld",&b);
     for(k=0;k<b;k++)
     {scanf("%lld",&ni);
                                                                    for(i=0;i<ni;i++)
                                                                     scanf("%lld",&a[i]);
                                                                    // printf("%lld\n",b);
                                                                            mergesort(a,0,ni-1);
                                                                           // printf("%lld\n",b);
                                                                                   flag2=1;
              /*if((a[0]==1) && (a[1]==2) && (a[2]==3) && (ni==3))
                     { printf("%lld %lld %lld",a[0],a[1],a[2]);
                              flag1=0;
                     }*/
                             if((a[0]==2) && (a[1]==3)&& (ni==2))
                                    { printf("%lld %lld",a[0],a[1]);
                                            flag2=0;
                                    }                                                                                                                                                                                                                                                                                                                  
                                                             if((a[0]==1))
                                                                         {j=0; 
                                                                                      while(a[j]==1)
                                                                                        {printf("%lld ",a[j]);
                                                                                         j++;
                                                                                         }
                                                                                 if((a[j]==2) && (a[j+1]==3) && (ni==(j+2)))
                                                                                 printf("%lld %lld",a[j],a[j+1]);
                                                                                 else        
                                                                               for(i=ni-1;i>=j;i--)
                                                                                printf("%lld ",a[i]);
                                                                          }
                          if((a[0]!=1) && (flag2==1)) 
                                 for(i=ni-1;i>=0;i--)
                                   printf("%lld ",a[i]);
          printf("\n");
          //printf("%lld",b);
          //printf("%lld\n",k);
     }
     return 0;
   }      

[leppyr64]

Why are you posting about getting a runtime error in a topic about TLE? When you post a new topic be sure to say what type of RE you are getting.

[shivendramnnit]

sorry for that but can you tell me why i am getting runtime error?

[leppyr64]

Thank you for reading half of my post. Please read the rest of it.

[shivendramnnit]

i am getting SIGSEGV runtime error.pls help

[leppyr64]

SIGSEGV is typically caused by reading or writing outside of array bounds.