Multiselection requires to select r elements at specified ranks in a given set of n elements, r ≤ n. This paper proposes a paradigm for parallel multiselection to achieve the optimal cost. Following this paradigm and employing a cost-optimal algorithm for single-element selection, a cost-optimal parallel algorithm for multiselection is presented. Our algorithm runs in O(nϵ log r) time on an EREW PRAM with n1−ϵ processors for any 0 < ϵ < 1. In the special case when ϵ =log(lognlogn)logn, our algorithm requires O(lognlognlogr) time and O(n log r) cost.