十六、As Easy As A+B

Problem Description
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
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.

Output
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 9

Sample Output
1 2 3
1 2 3 4 5 6 7 8 9

#include <iostream>#include<algorithm>using namespace std;struct T{   int number;} t[1000][1000];int cmp(T a,T b){    return a.number<b.number;}int main(){    int num;    int line;    int a[1000];    while(cin>>line)    {        for(int i=0;i<line;i++)        {cin>>a[i];        for(int j=0;j<a[i];j++)            cin>>t[i][j].number;        }        for(int i=0;i<line;i++)        {          sort(t[i],t[i]+a[i],cmp);        for(int j=0;j<a[i];j++)          if(j!=a[i]-1)  cout<<t[i][j].number<<" ";                else cout<<t[i][j].number;        cout<<endl;}    }    return 0;}