题目1185：特殊排序

PRoblem:

Solution:

#include <iostream>#include <string>#include <algorithm>#include <vector>using namespace std;int main(){    int n;    while(cin >> n)    {        int i,m,max;        vector<int> ss;        max = 0;        for (i = 0;i < n;i++)        {            cin >> m;            ss.push_back(m);            if (m > max) max = m;        }        cout << max << endl;        if (n == 1)        {            cout << -1 << endl;            break;        }        sort(ss.begin(),ss.end());        for(i = 0;i < n-1;i++)        {            cout<< ss[i] << ' ';        }    }    return 0;}排序部分改为冒泡：
#include <iostream>#include <string>#include <algorithm>#include <vector>using namespace std;int main(){    int n;    while(cin >> n)    {        int i,m,max;        int  ss[n];        max = 0;        for (i = 0;i < n;i++)        {            cin >> m;            ss[i] = m;            if (m > max) max = m;        }        cout << max << endl;        if (n == 1)        {            cout << -1 << endl;            break;        }        for(i = 1;i < n;i++)        {            int temp;            for(int j = 0;j < n-i;j++)            {                if (ss[j] > ss[j+1])                {                    temp = ss[j];                    ss[j] = ss[j+1];                    ss[j+1] = temp;                }            }        }        for(i = 0;i < n-1;i++)        {            cout<<ss[i]<<' ';        }    }    return 0;}