HDU#1040：As Easy As A+B

最新推荐文章于 2026-01-08 17:35:35 发布

原创最新推荐文章于 2026-01-08 17:35:35 发布 · 392 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

HDU

当前文章被收录于：

HDU

24 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一个简单的排序问题，通过给出的样例输入和输出，详细解释了如何使用C++实现整数数组的升序排列，并提供了完整的代码示例。

Time Limit: 1000MS
Memory Limit: 32768KB
64bit IO Format: %I64d & %I64u

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

AC代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int T,N;
    cin>>T;
    for(int i=0;i<T;i++)
    {
        int a[10000];
        cin>>N;
        for(int k=0;k<N;k++)
        {
            cin>>a[k];
        }
        sort(a,a+N);
        for(int p=0;p<N-1;p++)
        {
            cout<<a[p]<<" ";
        }
        cout<<a[N-1];
        cout<<endl;
    }
    return 0;
}