题目1181：遍历链表

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;
//1181
vector<int> v;
int n;
int main(){
    //freopen("input.txt","r",stdin);
    while(cin>>n){
        v.clear();
        while(n--){
            int t;
            cin>>t;
            v.push_back(t);
        }
        sort(v.begin(),v.end());
        for(int i=0;i<v.size();i++)
            if(i==0)    printf("%d",v[i]);
            else        printf(" %d",v[i]);
        cout<<endl;
    }
    return 0;
}
 
/**************************************************************
    Problem: 1181
    User: cust123
    Language: C++
    Result: Accepted
    Time:130 ms
    Memory:1520 kb
****************************************************************/