1064. Complete Binary Search Tree

a1064.cpp

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int N;
int pos = 0;
int tree[1005];
vector<int> input;

void build(int root)
{
	if (root > N)
		return;
	auto l = 2 * root, r = 2 * root + 1;
	build(l);
	tree[root] = input[pos++];
	build(r);
}

int main()
{
	cin >> N;
	for (auto i = 0; i < N; ++i)
	{
		int t;
		cin >> t;
		input.push_back(t);
	}
	sort(input.begin(), input.end());

	build(1);

	cout << tree[1];
	for (auto i = 2; i <= N; ++i)
		cout << " " << tree[i];
	cout << endl;
	return 0;
}