三种方法：sort()+multiset容器+递归函数

解题思路:

注意事项:

注意题目说可能有多组测试数据，所以要使用循环输入，我就是刚开始没注意，根本不知道自己代码哪里出问题了-_-

参考代码:

//sort()

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std ;

int main ( )

{

         int n = 0 ;

         while ( cin >> n )

         {

                 //int a[n] = {0} ;

                 vector<int> v( n , 0 ) ;

                 for ( int i = 0 ; i < n ; i ++ )

                 {

                         // cin >> a[i] ;

                         cin >> v[i] ;

                 }

                 //sort(a, a+n) ;

                 sort( v.begin() , v.end() ) ;

                 for ( int i = 0 ; i < n ; i ++ )

                 {

                         //cout << a[i] << " " ;

                         cout << v[i] << " " ;

                 }

                 cout << endl ;

         }

         return 0 ;

}

/*

//multiset 容器

#include<iostream>

#include<set>

using namespace std ;

int main ( )

{

         int n = 0 ;

         while ( cin >> n )

         {

                 multiset < int > v ;

                 for ( int i = 0 ; i < n ; i ++ )

                 {

                         int a = 0 ;

                         cin >> a ;

                         v.insert(a) ;

                 }

                 for ( auto it : v )

                 {

                          cout << it << " " ;

                 }

                 cout << endl ;

         }

         return 0 ;

}

*/

/*

//递归函数

#include<iostream>

#include<vector>

using namespace std ;

void ko ( vector<int> &v , int len )

{

         if ( len == 1 ) return ;

         for ( int i = 0 ; i < len-1 ; i ++ )

         {

                 if ( v[i+1] < v[i] )

                 {

                         int temp = v[i] ;

                         v[i] = v[i+1] ;

                         v[i+1] = temp ;

                 }

         }

         ko ( v , len-1 ) ; 

}

//查看冒泡算法可写

int main ( )

{

         int n = 0 ;

         while ( cin >> n )

         {

                 vector< int > v ( n , 0 ) ;

                 for ( int i = 0 ; i < n ; i ++ )

                 {

                          cin >> v[i]  ;

                 }

                 ko ( v , n ) ;

                 for ( auto it : v )

                 {

                          cout << it << " "  ; 

                 }

                 cout << endl ;

         }

         return 0 ;

}

*/