[step:Close $\mathcal{S}$ under finite maxima to build a single maximizing sequence]
[claim:Closure of $\mathcal{S}$ under pairwise maxima]
If $\rho_1, \rho_2 \in \mathcal{S}$, then the measure $\rho_1 \vee \rho_2$ defined by $(\rho_1 \vee \rho_2)(A) := \sup \{ \rho_1(B) + \rho_2(A \setminus B) : B \in \mathcal{A}, B \subseteq A \}$ belongs to $\mathcal{S}$.
[/claim]
[proof]
We verify countable additivity. Let $(A_m)_{m=1}^\infty$ be pairwise disjoint sets in $\mathcal{A}$ with $A = \bigcup_{m=1}^\infty A_m$. For any $B \subseteq A$ with $B \in \mathcal{A}$, set $B_m := B \cap A_m$. Then $(B_m)$ are disjoint, $B = \bigcup_m B_m$, and:
\begin{align*}
\rho_1(B) + \rho_2(A \setminus B) &= \sum_{m=1}^\infty \rho_1(B_m) + \sum_{m=1}^\infty \rho_2(A_m \setminus B_m) = \sum_{m=1}^\infty [\rho_1(B_m) + \rho_2(A_m \setminus B_m)] \\
&\le \sum_{m=1}^\infty (\rho_1 \vee \rho_2)(A_m).
\end{align*}
Taking the supremum over $B$ gives $(\rho_1 \vee \rho_2)(A) \le \sum_m (\rho_1 \vee \rho_2)(A_m)$. For the reverse inequality, for each $m$ and $\varepsilon > 0$, choose $B_m \subseteq A_m$ achieving $\rho_1(B_m) + \rho_2(A_m \setminus B_m) \ge (\rho_1 \vee \rho_2)(A_m) - \varepsilon/2^m$. Setting $B = \bigcup_m B_m \subseteq A$:
\begin{align*}
(\rho_1 \vee \rho_2)(A) \ge \rho_1(B) + \rho_2(A \setminus B) = \sum_{m=1}^\infty [\rho_1(B_m) + \rho_2(A_m \setminus B_m)] \ge \sum_{m=1}^\infty (\rho_1 \vee \rho_2)(A_m) - \varepsilon.
\end{align*}
Since $\varepsilon > 0$ is arbitrary, countable additivity holds.
Next, $(\rho_1 \vee \rho_2)(A) \le \nu(A)$: for any $B \subseteq A$, $\rho_1(B) + \rho_2(A \setminus B) \le \nu(B) + \nu(A \setminus B) = \nu(A)$.
Finally, $(\rho_1 \vee \rho_2) \ll \mu$: if $\mu(A) = 0$, then the only $B \subseteq A$ with $B \in \mathcal{A}$ satisfies $\mu(B) = 0$, so $\rho_1(B) = 0$ and $\rho_2(A \setminus B) = 0$ (since $\mu(A \setminus B) \le \mu(A) = 0$). Thus $(\rho_1 \vee \rho_2)(A) = 0$.
[/proof]
For each $k$, iteratively replace pairs in the maximizing sequence $(\rho_{k,j})_j$ by their pairwise maxima. Define $\sigma_{k,1} := \rho_{k,1}$ and $\sigma_{k,j} := \sigma_{k,j-1} \vee \rho_{k,j}$ for $j \ge 2$. Then $\sigma_{k,j} \in \mathcal{S}$, $\sigma_{k,j}(X_k) \ge \rho_{k,j}(X_k)$, and the sequence $(\sigma_{k,j}(X_k))_j$ is nondecreasing with limit $s_k$.
Now define a single sequence that simultaneously maximizes on every $X_k$. By a diagonal construction, define $\tau_j := \sigma_{1,j} \vee \sigma_{2,j} \vee \cdots \vee \sigma_{j,j}$. Then $\tau_j \in \mathcal{S}$ (by iterated application of the claim), $(\tau_j(A))_j$ is nondecreasing for every $A \in \mathcal{A}$, and $\tau_j(X_k) \to s_k$ for every $k$.
[/step]