Given a sufficiently well-behaved function $1\le f(x)\le x$ and a multiset $S=\{\omega(n): 1\le n\le x\}$, what can be said about the asymptotics of the $f(x)$-th largest member of $S$? In other words, what is the maximum value of $\min(T)$ where $T\subseteq S$ and $|T|=f(x)$?
If $f(x):=1$ this is asking for the largest number of prime factors which a number up to $x$ can be divisible by, which is $\pi(\vartheta^{-1}(\log x)) \sim \log x/\log\log x$ by (two invocations of) the Prime Number Theorem. More generally you get $\pi(\vartheta^{-1}(\log(x/k))) \sim \log x/\log\log x$ for $f(x):=k$ with any fixed constant $k$.
If $f(x):=kx$ for some fixed $0<k<x$ then the Erdős-Kac theorem gives $$ \log\log x+c\sqrt{\log\log x} $$ with a constant $c=-\sqrt2\operatorname{erf}^{-1}(1-2k)$.
I'm interested in $f(x)$ between these two, for example $$ f(x):=x^{1-\frac{\log\log\log x}{\log\log x}}. $$ How is this usually treated? I would appreciate references to the literature -- I'm sure this isn't new and I don't want to reinvent the wheel.