很遗憾,提交没被接受,希望哪位高手来指点一下:
题目:as easy as A+B
问题描述:
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights. Give you some integers, your task is to sort these number ascending (升序). You should know how easy the problem is now! Good luck!输入:Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line. It is guarantied that all integers are in the range of 32-int.输出:For each case, print the sorting result, and one line one case.Sample input:
2 3 2 1 3 9 1 4 7 2 5 8 3 6 9Sample output:1 2 3 1 2 3 4 5 6 7 8 9
#include<stdio.h>
void main()
{
int T;
scanf("%d",&T);
for(int i=0;i<T;i++)
{
int N;
scanf("%d",&N);
int *array=new int[N];
for(int j=0;j<N;j++)
{
scanf("%d",&array[j]);
if((j>0)&&(array[j]<array[j-1]))
{
int temp=array[j];
for(int m=0;m<j;m++)
{
if(temp<array[m])
{
for(int k=j;k>m;k--)
{
array[k]=array[k-1];
}
array[m]=temp;
break;
}
}
}
}
for(j=0;j<N;j++)
{
printf("%d ",array[j]);
}
printf("/n");
delete array;
}
}