数列排序（用容器比较快）

解题思路:

注意事项:

参考代码:

#include<vector>

#include<iostream>

#include<string>

#include<algorithm>

#include<cmath>

#include<cstdio>

#include<deque>

using namespace std;

int main()

{

deque<int>s;

int n;

cin >> n;

while (n--)

{

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

{

int a;

cin >> a;

s.push_back(a);

}

deque<int>::iterator it1 = s.begin();

int t = *it1;

int m = s.size();

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

if (s.at(i) < t)

{

int m = s.at(i);

s.erase(s.begin()+i);

s.push_front(m);

}

deque<int>::iterator it = s.begin();

for (int i = 0; it != s.end(); i++, it++)

if (i == 8)

cout << *it << endl;

else

cout << *it << " ";

s.clear();

}

return 0;

}