HDU排序水题
1040水题;
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!
SRE实战 互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。 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
Author lcy
#include<iostream>
#include<cmath> #include<math.h> #include<ctype.h> #include<cstring> #include <algorithm> using namespace std; #define MAX 1005 bool cmp(int a,int b) { return a < b; } int main() { int t = 0; int n = 1; int a[MAX]; cin >> t; while(t--) { memset(a,0,sizeof(a)); cin >> n; for(int i = 0; i < n; i++) { cin >> a[i]; } sort(a,a+n,cmp); int temp = n-1; for(int j = 0; j < n;j++) { if(temp--) cout << a[j] << " "; else cout << a[j]; } cout << endl; } return 0; }
更多精彩
