2019 数列有序

#include<iostream>#include<vector>#include<algorithm>using namespace std;int main(void){    int n,m;    vector<int> v;    int temp;    while(cin>>n>>m)    {        if(n==0&&m==0)        {            break;        }        if(n==0)        {            cout<<m<<endl;            break;        }        v.clear();        for(int i=0;i<n;i++)        {            cin>>temp;            v.push_back(temp);        }        v.push_back(m);        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;}