HDOJ 1040 As Easy As A+B

最新推荐文章于 2019-08-07 21:02:35 发布

原创最新推荐文章于 2019-08-07 21:02:35 发布 · 402 阅读

0 ·

CC 4.0 BY-SA版权

模版专栏收录该内容

3 篇文章

订阅专栏

本文将指导您如何通过简单的步骤理解并实现整数排序算法，从输入数据到输出有序列表，全程仅需几步。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
//
//  main.cpp
//  As Easy As A+B
//
//  Created by 张嘉韬 on 16/3/15.
//  Copyright © 2016年 张嘉韬. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int cmp(const void *a,const void *b)
{
    return *(int *)a>*(int *)b?1:-1;
}
int main(int argc, const char * argv[]) {
    //freopen("/Users/zhangjiatao/Desktop/input.txt","r",stdin);
    int t;
    while(scanf("%d",&t)==1)
    {
        for(int j=1;j<=t;j++){
        int n,a[3000];
        cin>>n;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++) cin>>a[i];
        qsort(a,n,sizeof(a[0]),cmp);
        for(int i=0;i<n;i++)
        {
            cout<<a[i];
            if(i!=n-1) cout<<" ";
        }
        //if(j!=t)
            cout<<endl;
        }
    }
    return 0;
}