It was conjectured by Ohba and confirmed recently by Noel et al. that, for any graph $G$, if $|V(G)|\le 2χ(G)+1$ then $χ_l(G)=χ(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We show that this is also the case for uniform hypergraphs and further propose a generalized version of Ohba's conjecture: for any $r$-uniform hypergraph $H$ with $r\geq 2$, if $|V(H)|\le rχ(H)+r-1$ then $χ_l(H)=χ(H)$. We show that the condition of the proposed conjecture is sharp by giving two classes of $r$-uniform hypergraphs $H$ with $|V(H)|= rχ(H)+r$ and $χ_l(H)>χ(H)$. To support the conjecture, we give two classes of $r$-uniform hypergraphs $H$ with $|V(H)|= rχ(H)+r-1$ and prove that $χ_l(H)=χ(H)$.