关于我们

质量为本、客户为根、勇于拼搏、务实创新

< 返回

hdu1040

发布时间:2022-07-27 13:55:58

As Easy As A+B

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26298    Accepted Submission(s): 11177 hdu1040
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        
  1. #include<iostream>
  2. #include<algorithm>
  3. using namespace std;
  4. int main()
  5. {
  6.     int i,n,m;
  7.     int a[1001];
  8.     scanf("%d ",&n);
  9.     while(n--)
  10.     {
  11.         scanf("%d",&m);
  12.         for(i=0;i<m;i++)
  13.         scanf("%d",&a[i]);
  14.         sort(a,a+m);
  15.         for(i=0;i<m-1;i++)
  16.         {
  17.             printf("%d ",a[i]);
  18.         }
  19.         printf("%d ",a[m-1]);
  20.     }
  21.     return 0;
  22. }

/template/Home/DawnNew/PC/Static

立即注册风纳云账号,免费体验多款产品

立即注册