#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
const int N = 7;
int arr[N] = { 3, 17, 2, 9, 1, 5, 7 };
int max = arr[0];
for (int i = 1; i < N; i++)
{
if (max < arr[i])
max = arr[i];
}
int sort_arr[N];
copy(cbegin(arr), cend(arr), begin(sort_arr));
sort(begin(sort_arr), end(sort_arr));
for (int i = 0; i < N; i++)
{
cout << sort_arr[i] << " ";
}
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKICAgIGludCBtYWluKCkKICAgIHsKCQljb25zdCBpbnQgTiA9IDc7CgkJaW50IGFycltOXSA9IHsgMywgMTcsIDIsIDksIDEsIDUsIDcgfTsKCQkKCQlpbnQgbWF4ID0gYXJyWzBdOwoJCWZvciAoaW50IGkgPSAxOyBpIDwgTjsgaSsrKQoJCXsKCQkgICBpZiAobWF4IDwgYXJyW2ldKSAKCQkJICAgbWF4ID0gYXJyW2ldOwoJCX0KCQlpbnQgc29ydF9hcnJbTl07CgkJCgkJY29weShjYmVnaW4oYXJyKSwgY2VuZChhcnIpLCBiZWdpbihzb3J0X2FycikpOwoJCXNvcnQoYmVnaW4oc29ydF9hcnIpLCBlbmQoc29ydF9hcnIpKTsKCQkKCQlmb3IgKGludCBpID0gMDsgaSA8IE47IGkrKykKCQl7CgkJICAgY291dCA8PCBzb3J0X2FycltpXSA8PCAiICI7CgkJfQogICAgfQ==