数列排序C++

解题思路:

注意事项:

参考代码:

#include <iostream>

using namespace std;

int a[1000000], b[1000000];

int main()

{

int n;

cin >> n;

while (n--)

{

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

{

cin >> a[i];

}

int k1 = a[1];

b[k1] = k1;

int t = k1, f = k1;

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

{

if (a[i] < b[k1])

{

b[t - 1] = a[i];

t--;

}

if (a[i] > b[k1])

{

b[f + 1] = a[i];

f++;

}

}

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

{

cout << b[i] << " ";

}

cout << endl;

}

return 0;

}