#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> arr { 20, 10, 5, 15, 35, 40, 25, 30 };
int i;
int j;
int n = arr.size();
for (i = 0; i < n-1; i++)
for (j = i+1; j < n; j++)
if (arr[i] > arr[j])
swap(arr[i], arr[j]);
for (unsigned i = 0; i < arr.size(); ++i) {
cout << arr[i] << " " << endl;
}
return 0;
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkKewogICAgdmVjdG9yPGludD4gYXJyIHsgMjAsIDEwLCA1LCAxNSwgMzUsIDQwLCAyNSwgMzAgfTsKCiAgICBpbnQgaTsKICAgIGludCBqOwogICAgaW50IG4gPSBhcnIuc2l6ZSgpOwoKICAgIGZvciAoaSA9IDA7IGkgPCBuLTE7IGkrKykKICAgICAgICBmb3IgKGogPSBpKzE7IGogPCBuOyBqKyspCiAgICAgICAgICAgIGlmIChhcnJbaV0gPiBhcnJbal0pCiAgICAgICAgICAgICAgICBzd2FwKGFycltpXSwgYXJyW2pdKTsKCiAgICBmb3IgKHVuc2lnbmVkIGkgPSAwOyBpIDwgYXJyLnNpemUoKTsgKytpKSB7CiAgICAgICAgY291dCA8PCBhcnJbaV0gPDwgIiAiIDw8IGVuZGw7CiAgICB9CiAgICByZXR1cm4gMDsKfQo=