This is not at all a complete answer but a remark which can be improved. It is a completely rewritten and replaces bullshit (explaining the first comments.)
Suppose the answer to Segerman's question is no. There exists thus a counterexample given by a decreasing sequence $r_1\geq \dots \geq r_n$ of radii such that $\sum_{i=1}^n r_i^2=1/2$ and one can not fit $n$ circles with radii $r_1,\dots,r_n$ into a circle $C_1$ of radius $1$. Suppose $n$ is the smallest integer for which a counterexample exists. Then $r_1<2/3$. Indeed, the area $\pi(1/2-r_1^2)$ of the discs of radii $r_2,\dots,r_n$ is at most half the area $\pi(1-\rho_1)^2$ of the largest disc $C'$ which fits together with the disc $C_1$ of radius $r_1$ into $C$. Since $n$ is minimal, the $(n-1)$ circles of radii $r_2,\dots,r_n$ can be packed into $C'$.
This kind of argument can be improved (pack the circles of radii $r_2,\dots$ into more than one circle of suitable radii which fit into $C$ together with $ C_1$) in order to lower the upper bound on the largest radius of a minimal counterexample.
I guess one can use a packing argument showing that a solution always exists if the largest radius is small enough.
These two bounds can perhaps be made to met (but I fear that the involved combinatorics are quite messy).