I assume you're dealing with positive numbers $a_i$ and $b_i$, for otherwise the $n$th roots won't always make sense. Also, the result is clearly false if some of the numbers are permitted to be zero.
My answer is unfortunately not at the precalculus level.
Let $x_n = \sqrt[n]{a_1}+\sqrt[n]{a_2}+\cdots+\sqrt[n]{a_k}$. Now write $c_i = \log a_i$ for $i=1, \dots, k$.
Using the Taylor expansion of degree $p$ for $e^t$ near $t = 0$, we find
$$x_n = \sum_{i=1}^k e^{c_i/n} = k + \left(\sum_{i=1}^k c_i \right)\frac{1}{n} + \frac{1}{2!} \left(\sum_{i=1}^k c_i^2 \right)\frac{1}{n^2} + \dots + \frac{1}{p!}\left(\sum_{i=1}^k c_i^p \right)\frac{1}{n^p} + o\left( \frac{1}{n^p}\right).$$
Since the asymptotic expansion of the sequence $\{ x_n \}$ in powers of $1/n$ is well determined, this proves that the number $k$, and the sums of powers $S_1 = \sum_i c_i$, $S_2 = \sum_i c_i^2$,... , $S_p = \sum_i c_i^p$, are well determined by $\{x_n\}$. This is valid for an arbitrary choice of $p$. In turn, Newton's identities (http://en.wikipedia.org/wiki/Newton%27s_identities ), show that the elementary symmetric polynomials $\sigma_1$, ..., $\sigma_k$ of the $c_i$'s are well determined by $\{ x_n \}$. The numbers $c_1$, ..., $c_k$ are the roots of the polynomial
$$x^k - \sigma_1 x^{k-1} + \dots \pm \sigma_k = 0.$$
Hence the numbers $c_i$ are determined by $\{ x_n \}$, up to permutation. Considering that the sequence $c_1$, ..., $c_k$, is arranged in increasing order, this shows that the $c_i$'s, and therefore the $a_i$'s, are well determined by the sequence $\{ x_n \}$.