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>
#include <vector>
using namespace std;
//QAQ:不知道为什么我最开始用set容器写的代码AC不了,有大神想帮我看看代码的话可以私信我~
int main()
{
int n, m, t;
cin >> n;
while(n --)
{
vector<int> v;
cin >> m;
for(int i = 0; i < m; i ++)
{
cin >> t;
v.push_back(t);
}
sort(v.begin(), v.end());
for(int i = 0; i < v.size(); i ++)
{
if(i == 0) cout << v[i];
else cout << " " << v[i];
}
cout << endl;
}
return 0;
}