<span style="font-size:18px;">#include<cstdio>
#include<algorithm>
using namespace std;
const int Max=1000;
int a[Max+10];
int main(){
int t;
while(scanf("%d",&t)==1){
for(int k=0;k<t;k++){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
printf("%d",a[0]);
for(int i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
}
}
return 0;
}
</span>
As Easy As A+B--最基本sor排序样例
最新推荐文章于 2018-03-15 10:32:12 发布