单选题：You have 10 identical cores on which you want to schedule some $

You have 10 identical cores on which you want to schedule some $n$ jobs. Each job $j \in \{1,2, \ldots,n\}$ has a processing time $p_j > 0$. If $S_i$ is the set of jobs assigned to core $i$, let the load be $ \sum_{j\in S_i} p_j$. Now, you want to partition the jobs among the cores to minimize the load of the most-loaded core.

We design a greedy algorithm that picks any unassigned job, and assign it to the core with the least current load.
What is the approximation ratio of the greedy algorithm? (Choose the smallest bound that applies.)






A.1
B.1.5
C.1.9
D.2


答案：C